Base | Representation |
---|---|
bin | 10110110010001000011001… |
… | …110100100011000100011010 |
3 | 111010210012221002000002021220 |
4 | 112302020121310203010122 |
5 | 101113202214134034320 |
6 | 553040101141112510 |
7 | 30051233320531065 |
oct | 2662103164430432 |
9 | 433705832002256 |
10 | 100202020221210 |
11 | 29a22490176486 |
12 | b2a39a59b8736 |
13 | 43bb018b6c48b |
14 | 1aa5b373338dc |
15 | b8b74029ce40 |
hex | 5b2219d2311a |
100202020221210 has 64 divisors (see below), whose sum is σ = 240590372746752. Its totient is φ = 26708815351296.
The previous prime is 100202020221101. The next prime is 100202020221223. The reversal of 100202020221210 is 12122020202001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 100202020221210.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1286367024 + ... + 1286444916.
It is an arithmetic number, because the mean of its divisors is an integer number (3759224574168).
Almost surely, 2100202020221210 is an apocalyptic number.
100202020221210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100202020221210 is an abundant number, since it is smaller than the sum of its proper divisors (140388352525542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100202020221210 is a wasteful number, since it uses less digits than its factorization.
100202020221210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96167.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 100202020221210 its reverse (12122020202001), we get a palindrome (112324040423211).
The spelling of 100202020221210 in words is "one hundred trillion, two hundred two billion, twenty million, two hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •