Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1101010010101110000100 |
3 | 1100010010020122111012020010 |
4 | 2110123211131102232010 |
5 | 2314104302104201040 |
6 | 33405510121510220 |
7 | 2101635015434511 |
oct | 224334535225604 |
9 | 40103218435203 |
10 | 10200102022020 |
11 | 3282925747939 |
12 | 1188a21642370 |
13 | 58cb33648651 |
14 | 27398a9aa308 |
15 | 12a4dc31ae80 |
hex | 946e5752b84 |
10200102022020 has 48 divisors (see below), whose sum is σ = 28560651110208. Its totient is φ = 2719992401280.
The previous prime is 10200102022013. The next prime is 10200102022037. The reversal of 10200102022020 is 2022020100201.
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 = 10200102021987 and 10200102022005.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3823807 + ... + 5917913.
It is an arithmetic number, because the mean of its divisors is an integer number (595013564796).
Almost surely, 210200102022020 is an apocalyptic number.
10200102022020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10200102022020 is an abundant number, since it is smaller than the sum of its proper divisors (18360549088188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200102022020 is a wasteful number, since it uses less digits than its factorization.
10200102022020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2175300 (or 2175298 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10200102022020 its reverse (2022020100201), we get a palindrome (12222122122221).
The spelling of 10200102022020 in words is "ten trillion, two hundred billion, one hundred two million, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •