Base | Representation |
---|---|
bin | 1010000000010100101001… |
… | …10111010101000001010111 |
3 | 2212220022020211011102112100 |
4 | 11000022110313111001113 |
5 | 10340432200411201403 |
6 | 114443133351453143 |
7 | 4430354135360622 |
oct | 500122467250127 |
9 | 85808224142470 |
10 | 22001320022103 |
11 | 7012786640a84 |
12 | 25740056871b3 |
13 | c3793c173576 |
14 | 560c26160db9 |
15 | 282488bab2a3 |
hex | 140294dd5057 |
22001320022103 has 24 divisors (see below), whose sum is σ = 32805433964160. Its totient is φ = 14194141102080.
The previous prime is 22001320022063. The next prime is 22001320022107. The reversal of 22001320022103 is 30122002310022.
22001320022103 is a `hidden beast` number, since 220 + 0 + 1 + 320 + 0 + 22 + 103 = 666.
It is not a de Polignac number, because 22001320022103 - 28 = 22001320021847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001320022107) 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 23 ways as a sum of consecutive naturals, for example, 15237175 + ... + 16618487.
It is an arithmetic number, because the mean of its divisors is an integer number (1366893081840).
Almost surely, 222001320022103 is an apocalyptic number.
22001320022103 is a deficient number, since it is larger than the sum of its proper divisors (10804113942057).
22001320022103 is a wasteful number, since it uses less digits than its factorization.
22001320022103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1438439 (or 1438436 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 22001320022103 its reverse (30122002310022), we get a palindrome (52123322332125).
The spelling of 22001320022103 in words is "twenty-two trillion, one billion, three hundred twenty million, twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •