Base | Representation |
---|---|
bin | 1010000000101000111100… |
… | …00101101100001010100111 |
3 | 2212221100100220201101210100 |
4 | 11000110132011230022213 |
5 | 10341122002310400403 |
6 | 114452134244555143 |
7 | 4431221065352616 |
oct | 500243605541247 |
9 | 85840326641710 |
10 | 22012212200103 |
11 | 7017365a25584 |
12 | 25761453b2ab3 |
13 | c38986948cc8 |
14 | 56157a9a587d |
15 | 2828c504d2a3 |
hex | 14051e16c2a7 |
22012212200103 has 24 divisors (see below), whose sum is σ = 31845426462720. Its totient is φ = 14651745080400.
The previous prime is 22012212199969. The next prime is 22012212200117. The reversal of 22012212200103 is 30100221221022.
22012212200103 is a `hidden beast` number, since 220 + 1 + 221 + 220 + 0 + 1 + 0 + 3 = 666.
It is not a de Polignac number, because 22012212200103 - 28 = 22012212199847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22012212205103) 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, 13994218 + ... + 15487496.
It is an arithmetic number, because the mean of its divisors is an integer number (1326892769280).
Almost surely, 222012212200103 is an apocalyptic number.
22012212200103 is a deficient number, since it is larger than the sum of its proper divisors (9833214262617).
22012212200103 is a wasteful number, since it uses less digits than its factorization.
22012212200103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495859 (or 1495856 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 22012212200103 its reverse (30100221221022), we get a palindrome (52112433421125).
The spelling of 22012212200103 in words is "twenty-two trillion, twelve billion, two hundred twelve million, two hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •