Base | Representation |
---|---|
bin | 10110110000101001011010… |
… | …001100011110100110110111 |
3 | 111010102110122120111212002002 |
4 | 112300221122030132212313 |
5 | 101110014320340133421 |
6 | 552521152000205515 |
7 | 30040662556611626 |
oct | 2660513214364667 |
9 | 433373576455062 |
10 | 100100021021111 |
11 | 299931a929a7a1 |
12 | b28807a60989b |
13 | 43b15121057c7 |
14 | 1aa0c1c9856bd |
15 | b88c707acb0b |
hex | 5b0a5a31e9b7 |
100100021021111 has 2 divisors, whose sum is σ = 100100021021112. Its totient is φ = 100100021021110.
The previous prime is 100100021021089. The next prime is 100100021021137. The reversal of 100100021021111 is 111120120001001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100100021021111 - 214 = 100100021004727 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100100021021092 and 100100021021101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100100021021311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050010510555 + 50050010510556.
It is an arithmetic number, because the mean of its divisors is an integer number (50050010510556).
Almost surely, 2100100021021111 is an apocalyptic number.
100100021021111 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100021021111 is an equidigital number, since it uses as much as digits as its factorization.
100100021021111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100100021021111 its reverse (111120120001001), we get a palindrome (211220141022112).
The spelling of 100100021021111 in words is "one hundred trillion, one hundred billion, twenty-one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •