Base | Representation |
---|---|
bin | 1010000000010010001011… |
… | …1110010101110110110011 |
3 | 1102221120220202220201110022 |
4 | 2200010202332111312303 |
5 | 2420210443442402401 |
6 | 35221155044554055 |
7 | 2213503130246021 |
oct | 240044276256663 |
9 | 42846822821408 |
10 | 10999998012851 |
11 | 3561089121a41 |
12 | 1297a590b292b |
13 | 61a3abba9723 |
14 | 2a058d1b9711 |
15 | 14120641571b |
hex | a0122f95db3 |
10999998012851 has 2 divisors, whose sum is σ = 10999998012852. Its totient is φ = 10999998012850.
The previous prime is 10999998012823. The next prime is 10999998012853. The reversal of 10999998012851 is 15821089999901.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10999998012851 - 226 = 10999930903987 is a prime.
It is a super-2 number, since 2×109999980128512 (a number of 27 digits) contains 22 as substring.
Together with 10999998012853, 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 (10999998012853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5499999006425 + 5499999006426.
It is an arithmetic number, because the mean of its divisors is an integer number (5499999006426).
Almost surely, 210999998012851 is an apocalyptic number.
10999998012851 is a deficient number, since it is larger than the sum of its proper divisors (1).
10999998012851 is an equidigital number, since it uses as much as digits as its factorization.
10999998012851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37791360, while the sum is 71.
The spelling of 10999998012851 in words is "ten trillion, nine hundred ninety-nine billion, nine hundred ninety-eight million, twelve thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •