Base | Representation |
---|---|
bin | 101110100111010001… |
… | …1001101010011110011 |
3 | 100120101021202120102000 |
4 | 1131032203031103303 |
5 | 3120002114201321 |
6 | 113553011225043 |
7 | 10142423545521 |
oct | 1351643152363 |
9 | 316337676360 |
10 | 100102100211 |
11 | 394a9031543 |
12 | 17497ba8183 |
13 | 9593a0a179 |
14 | 4bb883b311 |
15 | 290d1a6826 |
hex | 174e8cd4f3 |
100102100211 has 64 divisors (see below), whose sum is σ = 155675520000. Its totient is φ = 63488468736.
The previous prime is 100102100209. The next prime is 100102100213. The reversal of 100102100211 is 112001201001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (100102100209) and next prime (100102100213).
It is not a de Polignac number, because 100102100211 - 21 = 100102100209 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 = 100102100193 and 100102100202.
It is not an unprimeable number, because it can be changed into a prime (100102100213) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 21391570 + ... + 21396248.
It is an arithmetic number, because the mean of its divisors is an integer number (2432430000).
Almost surely, 2100102100211 is an apocalyptic number.
100102100211 is a deficient number, since it is larger than the sum of its proper divisors (55573419789).
100102100211 is a wasteful number, since it uses less digits than its factorization.
100102100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5113 (or 5107 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100102100211 its reverse (112001201001), we get a palindrome (212103301212).
The spelling of 100102100211 in words is "one hundred billion, one hundred two million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •