Base | Representation |
---|---|
bin | 1001010010111100100100… |
… | …0110110011001101010100 |
3 | 1100012010110010010222021120 |
4 | 2110233021012303031110 |
5 | 2314430303401401322 |
6 | 33423301543043540 |
7 | 2103310262500410 |
oct | 224571106631524 |
9 | 40163403128246 |
10 | 10221101200212 |
11 | 3290821189261 |
12 | 1190b021405b0 |
13 | 591acc033386 |
14 | 2749bd867d40 |
15 | 12ad1ab54a5c |
hex | 94bc91b3354 |
10221101200212 has 48 divisors (see below), whose sum is σ = 28690810391040. Its totient is φ = 2766613858272.
The previous prime is 10221101200199. The next prime is 10221101200273. The reversal of 10221101200212 is 21200210112201.
It is a junction number, because it is equal to n+sod(n) for n = 10221101200191 and 10221101200200.
It is a congruent number.
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, 3202097778 + ... + 3202100969.
It is an arithmetic number, because the mean of its divisors is an integer number (597725216480).
Almost surely, 210221101200212 is an apocalyptic number.
10221101200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10221101200212 is an abundant number, since it is smaller than the sum of its proper divisors (18469709190828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221101200212 is a wasteful number, since it uses less digits than its factorization.
10221101200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6404198780 (or 6404198778 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10221101200212 its reverse (21200210112201), we get a palindrome (31421311312413).
The spelling of 10221101200212 in words is "ten trillion, two hundred twenty-one billion, one hundred one million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •