Base | Representation |
---|---|
bin | 101111000010000010… |
… | …0110110011111101111 |
3 | 100122200212112022011000 |
4 | 1132010010312133233 |
5 | 3123322012041421 |
6 | 114222050531343 |
7 | 10203606534153 |
oct | 1360404663757 |
9 | 318625468130 |
10 | 101000112111 |
11 | 39919a26138 |
12 | 176a8896b53 |
13 | 96a7a88962 |
14 | 4c61bdb063 |
15 | 2961e3e226 |
hex | 17841367ef |
101000112111 has 16 divisors (see below), whose sum is σ = 149639077120. Its totient is φ = 67329231480.
The previous prime is 101000112107. The next prime is 101000112127. The reversal of 101000112111 is 111211000101.
It is not a de Polignac number, because 101000112111 - 22 = 101000112107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101000112093 and 101000112102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000112511) 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, 363336 + ... + 577938.
It is an arithmetic number, because the mean of its divisors is an integer number (9352442320).
Almost surely, 2101000112111 is an apocalyptic number.
101000112111 is a deficient number, since it is larger than the sum of its proper divisors (48638965009).
101000112111 is a wasteful number, since it uses less digits than its factorization.
101000112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232043 (or 232037 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101000112111 its reverse (111211000101), we get a palindrome (212211112212).
The spelling of 101000112111 in words is "one hundred one billion, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •