Base | Representation |
---|---|
bin | 1001010010111001010000… |
… | …0110110100010010101000 |
3 | 1100012001011010222112122020 |
4 | 2110232110012310102220 |
5 | 2314421443233342300 |
6 | 33423033420424440 |
7 | 2103246244512501 |
oct | 224562406642250 |
9 | 40161133875566 |
10 | 10220212012200 |
11 | 3290405271133 |
12 | 11908b43a8120 |
13 | 5919b9a54018 |
14 | 274937723ba8 |
15 | 12acb7a618a0 |
hex | 94b941b44a8 |
10220212012200 has 96 divisors (see below), whose sum is σ = 31705938725760. Its totient is φ = 2723387161600.
The previous prime is 10220212012169. The next prime is 10220212012211. The reversal of 10220212012200 is 221021202201.
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 10220212012200.
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, 5441184 + ... + 7074383.
It is an arithmetic number, because the mean of its divisors is an integer number (330270195060).
Almost surely, 210220212012200 is an apocalyptic number.
10220212012200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10220212012200 is an abundant number, since it is smaller than the sum of its proper divisors (21485726713560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220212012200 is a wasteful number, since it uses less digits than its factorization.
10220212012200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12516947 (or 12516938 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10220212012200 its reverse (221021202201), we get a palindrome (10441233214401).
The spelling of 10220212012200 in words is "ten trillion, two hundred twenty billion, two hundred twelve million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •