Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …110010100101000111100111 |
3 | 111010002221220022122102110011 |
4 | 112233112200302211013213 |
5 | 101102040022320214114 |
6 | 552412231344511051 |
7 | 30031362042022054 |
oct | 2657264062450747 |
9 | 433087808572404 |
10 | 100011011101159 |
11 | 29959482537484 |
12 | b27297931b487 |
13 | 43a5cc8459412 |
14 | 1a9a7b737202b |
15 | b867b13031c4 |
hex | 5af5a0ca51e7 |
100011011101159 has 2 divisors, whose sum is σ = 100011011101160. Its totient is φ = 100011011101158.
The previous prime is 100011011101039. The next prime is 100011011101291. The reversal of 100011011101159 is 951101110110001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100011011101159 - 215 = 100011011068391 is a prime.
It is a super-2 number, since 2×1000110111011592 (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 (100011011101559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005505550579 + 50005505550580.
It is an arithmetic number, because the mean of its divisors is an integer number (50005505550580).
Almost surely, 2100011011101159 is an apocalyptic number.
100011011101159 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011011101159 is an equidigital number, since it uses as much as digits as its factorization.
100011011101159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 22.
The spelling of 100011011101159 in words is "one hundred trillion, eleven billion, eleven million, one hundred one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •