Base | Representation |
---|---|
bin | 1001010010010011111111… |
… | …1100001101001111110100 |
3 | 1100011002100002110012011000 |
4 | 2110210333330031033310 |
5 | 2314241002230310400 |
6 | 33414301123043300 |
7 | 2102443344061512 |
oct | 224447774151764 |
9 | 40132302405130 |
10 | 10210210010100 |
11 | 32871424099a1 |
12 | 118a982810530 |
13 | 590a84815499 |
14 | 2742691dd4b2 |
15 | 12a8ce90a600 |
hex | 9493ff0d3f4 |
10210210010100 has 72 divisors (see below), whose sum is σ = 32823934411520. Its totient is φ = 2722722668640.
The previous prime is 10210210010051. The next prime is 10210210010149. The reversal of 10210210010100 is 101001201201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10210210010051) and next prime (10210210010149).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1890776932 + ... + 1890782331.
Almost surely, 210210210010100 is an apocalyptic number.
10210210010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210210010100 is an abundant number, since it is smaller than the sum of its proper divisors (22613724401420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210210010100 is a wasteful number, since it uses less digits than its factorization.
10210210010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3781559286 (or 3781559273 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10210210010100 its reverse (101001201201), we get a palindrome (10311211211301).
The spelling of 10210210010100 in words is "ten trillion, two hundred ten billion, two hundred ten million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •