Base | Representation |
---|---|
bin | 1010000000100100110101… |
… | …11100111110110101110001 |
3 | 2212221010200120211211120110 |
4 | 11000102122330332311301 |
5 | 10341103001044231001 |
6 | 114451132053131533 |
7 | 4431112422004500 |
oct | 500223274766561 |
9 | 85833616754513 |
10 | 22010012102001 |
11 | 7016437039290 |
12 | 2575830629ba9 |
13 | c386c5bb1b01 |
14 | 56140c700837 |
15 | 2827e6d123d6 |
hex | 14049af3ed71 |
22010012102001 has 192 divisors, whose sum is σ = 39620633241600. Its totient is φ = 10716354432000.
The previous prime is 22010012101981. The next prime is 22010012102011. The reversal of 22010012102001 is 10020121001022.
It is not a de Polignac number, because 22010012102001 - 210 = 22010012100977 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (22010012102011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 6184323060 + ... + 6184326618.
It is an arithmetic number, because the mean of its divisors is an integer number (206357464800).
Almost surely, 222010012102001 is an apocalyptic number.
22010012102001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
22010012102001 is a deficient number, since it is larger than the sum of its proper divisors (17610621139599).
22010012102001 is a wasteful number, since it uses less digits than its factorization.
22010012102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5700 (or 5693 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 22010012102001 its reverse (10020121001022), we get a palindrome (32030133103023).
The spelling of 22010012102001 in words is "twenty-two trillion, ten billion, twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.248 sec. • engine limits •