Base | Representation |
---|---|
bin | 1001010011000001000111… |
… | …1100010111010010111010 |
3 | 1100012020121021120001111210 |
4 | 2110300101330113102322 |
5 | 2314440304214414320 |
6 | 33424023114503550 |
7 | 2103352461360501 |
oct | 224602174272272 |
9 | 40166537501453 |
10 | 10222323201210 |
11 | 3291298a5173a |
12 | 11911a3434bb6 |
13 | 591c6525b9a3 |
14 | 274a97c83838 |
15 | 12ad8d0890e0 |
hex | 94c11f174ba |
10222323201210 has 128 divisors (see below), whose sum is σ = 26718070579200. Its totient is φ = 2493174539520.
The previous prime is 10222323201161. The next prime is 10222323201221. The reversal of 10222323201210 is 1210232322201.
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, 198516087 + ... + 198567573.
It is an arithmetic number, because the mean of its divisors is an integer number (208734926400).
Almost surely, 210222323201210 is an apocalyptic number.
10222323201210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10222323201210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13359035289600).
10222323201210 is an abundant number, since it is smaller than the sum of its proper divisors (16495747377990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222323201210 is a wasteful number, since it uses less digits than its factorization.
10222323201210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63556.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10222323201210 its reverse (1210232322201), we get a palindrome (11432555523411).
The spelling of 10222323201210 in words is "ten trillion, two hundred twenty-two billion, three hundred twenty-three million, two hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •