Base | Representation |
---|---|
bin | 1001001100100011001101… |
… | …0000100101011000011100 |
3 | 1022210121210211010000200112 |
4 | 2103020303100211120130 |
5 | 2311130231012001340 |
6 | 33301005505345152 |
7 | 2062340166266453 |
oct | 223106320453034 |
9 | 38717724100615 |
10 | 10111213000220 |
11 | 324916115a152 |
12 | 11737549381b8 |
13 | 584638a4bc27 |
14 | 26d557467b9a |
15 | 128038793065 |
hex | 9323342561c |
10111213000220 has 12 divisors (see below), whose sum is σ = 21233547300504. Its totient is φ = 4044485200080.
The previous prime is 10111213000201. The next prime is 10111213000247. The reversal of 10111213000220 is 2200031211101.
It is a junction number, because it is equal to n+sod(n) for n = 10111213000195 and 10111213000204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 252780324986 + ... + 252780325025.
It is an arithmetic number, because the mean of its divisors is an integer number (1769462275042).
Almost surely, 210111213000220 is an apocalyptic number.
10111213000220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10111213000220 is an abundant number, since it is smaller than the sum of its proper divisors (11122334300284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111213000220 is a wasteful number, since it uses less digits than its factorization.
10111213000220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 505560650020 (or 505560650018 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10111213000220 its reverse (2200031211101), we get a palindrome (12311244211321).
The spelling of 10111213000220 in words is "ten trillion, one hundred eleven billion, two hundred thirteen million, two hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •