Base | Representation |
---|---|
bin | 1010000011110100001000… |
… | …11010011100111010110111 |
3 | 2220022202221122111100210101 |
4 | 11001322010122130322313 |
5 | 10344413412043213421 |
6 | 115014215241334531 |
7 | 4442132340616654 |
oct | 501720432347267 |
9 | 86282848440711 |
10 | 22121303101111 |
11 | 7059656999105 |
12 | 259330b797447 |
13 | c460509b4ac6 |
14 | 566969140c2b |
15 | 28565c41d191 |
hex | 141e8469ceb7 |
22121303101111 has 4 divisors (see below), whose sum is σ = 22138438116424. Its totient is φ = 22104168085800.
The previous prime is 22121303101103. The next prime is 22121303101141. The reversal of 22121303101111 is 11110130312122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22121303101111 - 23 = 22121303101103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22121303101141) 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 3 ways as a sum of consecutive naturals, for example, 8567505720 + ... + 8567508301.
It is an arithmetic number, because the mean of its divisors is an integer number (5534609529106).
Almost surely, 222121303101111 is an apocalyptic number.
22121303101111 is a deficient number, since it is larger than the sum of its proper divisors (17135015313).
22121303101111 is a wasteful number, since it uses less digits than its factorization.
22121303101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17135015312.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 22121303101111 its reverse (11110130312122), we get a palindrome (33231433413233).
The spelling of 22121303101111 in words is "twenty-two trillion, one hundred twenty-one billion, three hundred three million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •