Base | Representation |
---|---|
bin | 1001001011111101111001… |
… | …1100000110011011100100 |
3 | 1022202122221222220222201110 |
4 | 2102333132130012123210 |
5 | 2310444224201134340 |
6 | 33252232140425020 |
7 | 2061534103340040 |
oct | 222773634063344 |
9 | 38678858828643 |
10 | 10101200021220 |
11 | 324499308a8a0 |
12 | 117181b548170 |
13 | 583701468c99 |
14 | 26cc876c7020 |
15 | 127b4e6be680 |
hex | 92fde7066e4 |
10101200021220 has 192 divisors, whose sum is σ = 37118285568000. Its totient is φ = 1988479549440.
The previous prime is 10101200021203. The next prime is 10101200021281. The reversal of 10101200021220 is 2212000210101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10101200021196 and 10101200021205.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 57449245 + ... + 57624804.
It is an arithmetic number, because the mean of its divisors is an integer number (193324404000).
Almost surely, 210101200021220 is an apocalyptic number.
10101200021220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10101200021220 is an abundant number, since it is smaller than the sum of its proper divisors (27017085546780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101200021220 is a wasteful number, since it uses less digits than its factorization.
10101200021220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115074098 (or 115074096 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10101200021220 its reverse (2212000210101), we get a palindrome (12313200231321).
The spelling of 10101200021220 in words is "ten trillion, one hundred one billion, two hundred million, twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •