Base | Representation |
---|---|
bin | 1010000000010101111010… |
… | …11001101010000110111011 |
3 | 2212220101000012212110202101 |
4 | 11000022331121222012323 |
5 | 10340440044012010021 |
6 | 114443325044244231 |
7 | 4430410034130325 |
oct | 500127531520673 |
9 | 85811005773671 |
10 | 22002000110011 |
11 | 7012aa55200a9 |
12 | 25741753a0677 |
13 | c37a1a03054c |
14 | 560c8c5d4615 |
15 | 2824c8748a91 |
hex | 1402bd66a1bb |
22002000110011 has 8 divisors (see below), whose sum is σ = 22010101367040. Its totient is φ = 21993899869032.
The previous prime is 22002000109967. The next prime is 22002000110093. The reversal of 22002000110011 is 11001100020022.
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 22002000110011 - 217 = 22001999978939 is a prime.
It is a super-2 number, since 2×220020001100112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22002000110011.
It is not an unprimeable number, because it can be changed into a prime (22002000114011) 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, 44506530 + ... + 44998168.
It is an arithmetic number, because the mean of its divisors is an integer number (2751262670880).
Almost surely, 222002000110011 is an apocalyptic number.
22002000110011 is a deficient number, since it is larger than the sum of its proper divisors (8101257029).
22002000110011 is a wasteful number, since it uses less digits than its factorization.
22002000110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508025.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 22002000110011 its reverse (11001100020022), we get a palindrome (33003100130033).
The spelling of 22002000110011 in words is "twenty-two trillion, two billion, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •