Base | Representation |
---|---|
bin | 1010000000111001100010… |
… | …01010010001001101010100 |
3 | 2212222012100212021022120121 |
4 | 11000130301022101031110 |
5 | 10341243224224231400 |
6 | 114500210331041324 |
7 | 4431654635312362 |
oct | 500346112211524 |
9 | 85865325238517 |
10 | 22021122102100 |
11 | 7020118378850 |
12 | 2577a112a0244 |
13 | c39776841874 |
14 | 561b84046632 |
15 | 282c4737e21a |
hex | 140731291354 |
22021122102100 has 36 divisors (see below), whose sum is σ = 52130001778848. Its totient is φ = 8007680764000.
The previous prime is 22021122102041. The next prime is 22021122102121. The reversal of 22021122102100 is 120122112022.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10009599856 + ... + 10009602055.
It is an arithmetic number, because the mean of its divisors is an integer number (1448055604968).
Almost surely, 222021122102100 is an apocalyptic number.
22021122102100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22021122102100 is an abundant number, since it is smaller than the sum of its proper divisors (30108879676748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22021122102100 is a wasteful number, since it uses less digits than its factorization.
22021122102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20019201936 (or 20019201929 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22021122102100 its reverse (120122112022), we get a palindrome (22141244214122).
The spelling of 22021122102100 in words is "twenty-two trillion, twenty-one billion, one hundred twenty-two million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •