Base | Representation |
---|---|
bin | 10110110000110011110100… |
… | …100001010100101000000111 |
3 | 111010110112111122221110121110 |
4 | 112300303310201110220013 |
5 | 101110210214212023421 |
6 | 552530241143020103 |
7 | 30041536602403020 |
oct | 2660636441245007 |
9 | 433415448843543 |
10 | 100111200111111 |
11 | 29997a15629552 |
12 | b28a27a43a633 |
13 | 43b25a4175a67 |
14 | 1aa159d553c47 |
15 | b891c6e25a76 |
hex | 5b0cf4854a07 |
100111200111111 has 128 divisors (see below), whose sum is σ = 169372960174080. Its totient is φ = 51279562801152.
The previous prime is 100111200111103. The next prime is 100111200111133. The reversal of 100111200111111 is 111111002111001.
It is not a de Polignac number, because 100111200111111 - 23 = 100111200111103 is a prime.
It is a super-2 number, since 2×1001112001111112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111200116111) 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, 273871615 + ... + 274236911.
It is an arithmetic number, because the mean of its divisors is an integer number (1323226251360).
Almost surely, 2100111200111111 is an apocalyptic number.
100111200111111 is a deficient number, since it is larger than the sum of its proper divisors (69261760062969).
100111200111111 is a wasteful number, since it uses less digits than its factorization.
100111200111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365713.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 100111200111111 its reverse (111111002111001), we get a palindrome (211222202222112).
The spelling of 100111200111111 in words is "one hundred trillion, one hundred eleven billion, two hundred million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •