Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …011111000011000001101111 |
3 | 111010002212112211021020212121 |
4 | 112233111222133003001233 |
5 | 101102031141100323434 |
6 | 552412001121013411 |
7 | 30031330336623634 |
oct | 2657255237030157 |
9 | 433085484236777 |
10 | 100010100011119 |
11 | 29959055220001 |
12 | b272764184267 |
13 | 43a5bb177bc9c |
14 | 1a9a72c36a18b |
15 | b8675b3357b4 |
hex | 5af56a7c306f |
100010100011119 has 2 divisors, whose sum is σ = 100010100011120. Its totient is φ = 100010100011118.
The previous prime is 100010100011047. The next prime is 100010100011137. The reversal of 100010100011119 is 911110001010001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100010100011119 - 215 = 100010099978351 is a prime.
It is a super-2 number, since 2×1000101000111192 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010100011219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005050005559 + 50005050005560.
It is an arithmetic number, because the mean of its divisors is an integer number (50005050005560).
Almost surely, 2100010100011119 is an apocalyptic number.
100010100011119 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010100011119 is an equidigital number, since it uses as much as digits as its factorization.
100010100011119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 100010100011119 in words is "one hundred trillion, ten billion, one hundred million, eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •