Base | Representation |
---|---|
bin | 101110100111010001… |
… | …0111001101110110101 |
3 | 100120101021121111102000 |
4 | 1131032202321232311 |
5 | 3120002104120041 |
6 | 113553005405513 |
7 | 10142423062653 |
oct | 1351642715665 |
9 | 316337544360 |
10 | 100102020021 |
11 | 394a8a87273 |
12 | 17497b69899 |
13 | 95939ac813 |
14 | 4bb8819dd3 |
15 | 290d18cbb6 |
hex | 174e8b9bb5 |
100102020021 has 32 divisors (see below), whose sum is σ = 148725957120. Its totient is φ = 66542902272.
The previous prime is 100102020001. The next prime is 100102020041. The reversal of 100102020021 is 120020201001.
It is an interprime number because it is at equal distance from previous prime (100102020001) and next prime (100102020041).
It is not a de Polignac number, because 100102020021 - 214 = 100102003637 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 = 100102019985 and 100102020012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102020001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30213261 + ... + 30216573.
It is an arithmetic number, because the mean of its divisors is an integer number (4647686160).
Almost surely, 2100102020021 is an apocalyptic number.
It is an amenable number.
100102020021 is a deficient number, since it is larger than the sum of its proper divisors (48623937099).
100102020021 is a wasteful number, since it uses less digits than its factorization.
100102020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6202 (or 6196 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100102020021 its reverse (120020201001), we get a palindrome (220122221022).
The spelling of 100102020021 in words is "one hundred billion, one hundred two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •