Base | Representation |
---|---|
bin | 101001111010011110… |
… | …0101111110100010001 |
3 | 22121022212122102212212 |
4 | 1103310330233310101 |
5 | 2433314240123441 |
6 | 105203255201505 |
7 | 6334335056333 |
oct | 1236474576421 |
9 | 277285572785 |
10 | 90008911121 |
11 | 35199758158 |
12 | 1553b976295 |
13 | 864592232c |
14 | 44dc17b453 |
15 | 251c03beeb |
hex | 14f4f2fd11 |
90008911121 has 2 divisors, whose sum is σ = 90008911122. Its totient is φ = 90008911120.
The previous prime is 90008911099. The next prime is 90008911123. The reversal of 90008911121 is 12111980009.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69624210496 + 20384700625 = 263864^2 + 142775^2 .
It is an emirp because it is prime and its reverse (12111980009) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-90008911121 is a prime.
Together with 90008911123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (90008911123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45004455560 + 45004455561.
It is an arithmetic number, because the mean of its divisors is an integer number (45004455561).
Almost surely, 290008911121 is an apocalyptic number.
It is an amenable number.
90008911121 is a deficient number, since it is larger than the sum of its proper divisors (1).
90008911121 is an equidigital number, since it uses as much as digits as its factorization.
90008911121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 32.
The spelling of 90008911121 in words is "ninety billion, eight million, nine hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •