Base | Representation |
---|---|
bin | 101111000101010101… |
… | …1111001101010010101 |
3 | 100122222121012121011220 |
4 | 1132022223321222111 |
5 | 3124033404340424 |
6 | 114241051520553 |
7 | 10206424264341 |
oct | 1361253715225 |
9 | 318877177156 |
10 | 101111011989 |
11 | 39976591929 |
12 | 17719a59159 |
13 | 96c4a477a0 |
14 | 4c72828621 |
15 | 296ba48579 |
hex | 178aaf9a95 |
101111011989 has 16 divisors (see below), whose sum is σ = 145209652224. Its totient is φ = 62211614400.
The previous prime is 101111011987. The next prime is 101111011993. The reversal of 101111011989 is 989110111101.
It is not a de Polignac number, because 101111011989 - 21 = 101111011987 is a prime.
It is a super-2 number, since 2×1011110119892 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111011987) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16524 + ... + 449994.
It is an arithmetic number, because the mean of its divisors is an integer number (9075603264).
Almost surely, 2101111011989 is an apocalyptic number.
It is an amenable number.
101111011989 is a deficient number, since it is larger than the sum of its proper divisors (44098640235).
101111011989 is a wasteful number, since it uses less digits than its factorization.
101111011989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439468.
The product of its (nonzero) digits is 648, while the sum is 33.
The spelling of 101111011989 in words is "one hundred one billion, one hundred eleven million, eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •