Base | Representation |
---|---|
bin | 1010000000111001100001… |
… | …00011101111011001000001 |
3 | 2212222012100011021012000000 |
4 | 11000130300203233121001 |
5 | 10341243214133031423 |
6 | 114500205330350213 |
7 | 4431654453415350 |
oct | 500346043573101 |
9 | 85865304235000 |
10 | 22021112002113 |
11 | 70201126aa554 |
12 | 2577a09a2b369 |
13 | c39774716643 |
14 | 561b82977997 |
15 | 282c46536843 |
hex | 1407308ef641 |
22021112002113 has 56 divisors (see below), whose sum is σ = 37823275492800. Its totient is φ = 12553459151904.
The previous prime is 22021112002079. The next prime is 22021112002117. The reversal of 22021112002113 is 31120021112022.
22021112002113 is a `hidden beast` number, since 220 + 21 + 11 + 200 + 211 + 3 = 666.
It is not a de Polignac number, because 22021112002113 - 210 = 22021112001089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22021112002117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 3011398 + ... + 7287711.
It is an arithmetic number, because the mean of its divisors is an integer number (675415633800).
Almost surely, 222021112002113 is an apocalyptic number.
It is an amenable number.
22021112002113 is a deficient number, since it is larger than the sum of its proper divisors (15802163490687).
22021112002113 is an equidigital number, since it uses as much as digits as its factorization.
22021112002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10299553 (or 10299538 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 22021112002113 its reverse (31120021112022), we get a palindrome (53141133114135).
The spelling of 22021112002113 in words is "twenty-two trillion, twenty-one billion, one hundred twelve million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •