Base | Representation |
---|---|
bin | 1001010001110001101011… |
… | …1110111000100011111110 |
3 | 1100010012120020020020011210 |
4 | 2110130122332320203332 |
5 | 2314113122001121342 |
6 | 33410135201025250 |
7 | 2101666201335204 |
oct | 224343276704376 |
9 | 40105506206153 |
10 | 10201000020222 |
11 | 3283246632210 |
12 | 1189032325226 |
13 | 58cc476c0b2b |
14 | 273a33d65074 |
15 | 12a54109e79c |
hex | 9471afb88fe |
10201000020222 has 128 divisors (see below), whose sum is σ = 22982190206976. Its totient is φ = 2991678560000.
The previous prime is 10201000020217. The next prime is 10201000020247. The reversal of 10201000020222 is 22202000010201.
It is a junction number, because it is equal to n+sod(n) for n = 10201000020198 and 10201000020207.
It is a congruent number.
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, 1824536647 + ... + 1824542237.
It is an arithmetic number, because the mean of its divisors is an integer number (179548360992).
Almost surely, 210201000020222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10201000020222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11491095103488).
10201000020222 is an abundant number, since it is smaller than the sum of its proper divisors (12781190186754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201000020222 is a wasteful number, since it uses less digits than its factorization.
10201000020222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10926.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10201000020222 its reverse (22202000010201), we get a palindrome (32403000030423).
The spelling of 10201000020222 in words is "ten trillion, two hundred one billion, twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •