Base | Representation |
---|---|
bin | 1010000000111011010110… |
… | …11100101110101100101011 |
3 | 2212222021220000101200202111 |
4 | 11000131223130232230223 |
5 | 10341302230101120021 |
6 | 114500451343143151 |
7 | 4432021111423120 |
oct | 500355334565453 |
9 | 85867800350674 |
10 | 22022100020011 |
11 | 702057a389a73 |
12 | 25780448a4ab7 |
13 | c398a1319a10 |
14 | 561c37c86747 |
15 | 282ca314c8e1 |
hex | 14076b72eb2b |
22022100020011 has 8 divisors (see below), whose sum is σ = 27104123101664. Its totient is φ = 17424079136640.
The previous prime is 22022100019921. The next prime is 22022100020051. The reversal of 22022100020011 is 11002000122022.
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 22022100020011 - 27 = 22022100019883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 22022100019973 and 22022100020000.
It is not an unprimeable number, because it can be changed into a prime (22022100020051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121000549470 + ... + 121000549651.
It is an arithmetic number, because the mean of its divisors is an integer number (3388015387708).
Almost surely, 222022100020011 is an apocalyptic number.
22022100020011 is a deficient number, since it is larger than the sum of its proper divisors (5082023081653).
22022100020011 is a wasteful number, since it uses less digits than its factorization.
22022100020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242001099141.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 22022100020011 its reverse (11002000122022), we get a palindrome (33024100142033).
The spelling of 22022100020011 in words is "twenty-two trillion, twenty-two billion, one hundred million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •