Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …110010010110010001111111 |
3 | 111020121121020102022010112000 |
4 | 112331300200302112101333 |
5 | 101214300022224031421 |
6 | 554451115212113343 |
7 | 30163036650234630 |
oct | 2675604062262177 |
9 | 436547212263460 |
10 | 101001001002111 |
11 | 2a200313a7a841 |
12 | b3b2806a65853 |
13 | 444847990cb12 |
14 | 1ad2690187887 |
15 | ba2403d64226 |
hex | 5bdc20c9647f |
101001001002111 has 128 divisors (see below), whose sum is σ = 178706125946880. Its totient is φ = 55123883337600.
The previous prime is 101001001002023. The next prime is 101001001002131. The reversal of 101001001002111 is 111200100100101.
It is not a de Polignac number, because 101001001002111 - 214 = 101001000985727 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101001001002093 and 101001001002102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001001002131) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 11499597226 + ... + 11499606008.
It is an arithmetic number, because the mean of its divisors is an integer number (1396141608960).
Almost surely, 2101001001002111 is an apocalyptic number.
101001001002111 is a deficient number, since it is larger than the sum of its proper divisors (77705124944769).
101001001002111 is a wasteful number, since it uses less digits than its factorization.
101001001002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12434 (or 12428 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101001001002111 its reverse (111200100100101), we get a palindrome (212201101102212).
The spelling of 101001001002111 in words is "one hundred one trillion, one billion, one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •