Base | Representation |
---|---|
bin | 1010110100100110110111… |
… | …1100011000111010000001 |
3 | 1120010112011002001000101001 |
4 | 2231021231330120322001 |
5 | 3024422423403111441 |
6 | 41150140411012001 |
7 | 2335444634561506 |
oct | 255115574307201 |
9 | 46115132030331 |
10 | 11898903957121 |
11 | 387832a097545 |
12 | 1402106a3a001 |
13 | 6840a5ab667c |
14 | 2d1ca516d4ad |
15 | 1597b7882731 |
hex | ad26df18e81 |
11898903957121 has 2 divisors, whose sum is σ = 11898903957122. Its totient is φ = 11898903957120.
The previous prime is 11898903957119. The next prime is 11898903957137. The reversal of 11898903957121 is 12175930989811.
11898903957121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6709711076721 + 5189192880400 = 2590311^2 + 2277980^2 .
It is a cyclic number.
It is not a de Polignac number, because 11898903957121 - 21 = 11898903957119 is a prime.
Together with 11898903957119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11898903952121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5949451978560 + 5949451978561.
It is an arithmetic number, because the mean of its divisors is an integer number (5949451978561).
Almost surely, 211898903957121 is an apocalyptic number.
It is an amenable number.
11898903957121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11898903957121 is an equidigital number, since it uses as much as digits as its factorization.
11898903957121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9797760, while the sum is 64.
The spelling of 11898903957121 in words is "eleven trillion, eight hundred ninety-eight billion, nine hundred three million, nine hundred fifty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •