Base | Representation |
---|---|
bin | 10100011111010011… |
… | …110011100010011011 |
3 | 2002210020002222211202 |
4 | 110133103303202123 |
5 | 330024012401021 |
6 | 14035014544415 |
7 | 1406116644260 |
oct | 243723634233 |
9 | 62706088752 |
10 | 22000122011 |
11 | 936a54a31a |
12 | 431b96810b |
13 | 20c7b9569a |
14 | 10c9bb3267 |
15 | 88b654a0b |
hex | 51f4f389b |
22000122011 has 4 divisors (see below), whose sum is σ = 25142996592. Its totient is φ = 18857247432.
The previous prime is 22000121993. The next prime is 22000122029. The reversal of 22000122011 is 11022100022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11022100022 = 2 ⋅5511050011.
It is an interprime number because it is at equal distance from previous prime (22000121993) and next prime (22000122029).
It is a cyclic number.
It is not a de Polignac number, because 22000122011 - 218 = 21999859867 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22000121983 and 22000122001.
It is not an unprimeable number, because it can be changed into a prime (22000122031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1571437280 + ... + 1571437293.
It is an arithmetic number, because the mean of its divisors is an integer number (6285749148).
Almost surely, 222000122011 is an apocalyptic number.
22000122011 is a deficient number, since it is larger than the sum of its proper divisors (3142874581).
22000122011 is an equidigital number, since it uses as much as digits as its factorization.
22000122011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3142874580.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 22000122011 its reverse (11022100022), we get a palindrome (33022222033).
The spelling of 22000122011 in words is "twenty-two billion, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •