Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …000110110110011101011 |
3 | 21011022122121002022100011 |
4 | 131123110200312303223 |
5 | 231112431200341021 |
6 | 4144552540152351 |
7 | 266046000331114 |
oct | 35332440666353 |
9 | 7138577068304 |
10 | 2022200012011 |
11 | 70a679208453 |
12 | 287aba8386b7 |
13 | 118900975c5a |
14 | 6dc3701720b |
15 | 37906e68de1 |
hex | 1d6d4836ceb |
2022200012011 has 8 divisors (see below), whose sum is σ = 2141181612144. Its totient is φ = 1903221596160.
The previous prime is 2022200011991. The next prime is 2022200012059. The reversal of 2022200012011 is 1102100022202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2022200012011 - 213 = 2022200003819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2022200011982 and 2022200012000.
It is not an unprimeable number, because it can be changed into a prime (2022200012311) 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 7 ways as a sum of consecutive naturals, for example, 579316 + ... + 2092846.
It is an arithmetic number, because the mean of its divisors is an integer number (267647701518).
Almost surely, 22022200012011 is an apocalyptic number.
2022200012011 is a deficient number, since it is larger than the sum of its proper divisors (118981600133).
2022200012011 is a wasteful number, since it uses less digits than its factorization.
2022200012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1592141.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2022200012011 its reverse (1102100022202), we get a palindrome (3124300034213).
The spelling of 2022200012011 in words is "two trillion, twenty-two billion, two hundred million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •