Base | Representation |
---|---|
bin | 111000100101001111… |
… | …0101110000110110001 |
3 | 102121122010222001012202 |
4 | 1301022132232012301 |
5 | 3442322203321231 |
6 | 131453104032545 |
7 | 11531045332052 |
oct | 1611236560661 |
9 | 377563861182 |
10 | 121508651441 |
11 | 475935142a1 |
12 | 1b671002755 |
13 | b5c5918428 |
14 | 5c4985c729 |
15 | 326265d5cb |
hex | 1c4a7ae1b1 |
121508651441 has 4 divisors (see below), whose sum is σ = 121567552512. Its totient is φ = 121449750372.
The previous prime is 121508651423. The next prime is 121508651449. The reversal of 121508651441 is 144156805121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121508651441 - 26 = 121508651377 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121508651395 and 121508651404.
It is not an unprimeable number, because it can be changed into a prime (121508651449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29447441 + ... + 29451566.
It is an arithmetic number, because the mean of its divisors is an integer number (30391888128).
Almost surely, 2121508651441 is an apocalyptic number.
It is an amenable number.
121508651441 is a deficient number, since it is larger than the sum of its proper divisors (58901071).
121508651441 is an equidigital number, since it uses as much as digits as its factorization.
121508651441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58901070.
The product of its (nonzero) digits is 38400, while the sum is 38.
The spelling of 121508651441 in words is "one hundred twenty-one billion, five hundred eight million, six hundred fifty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •