Base | Representation |
---|---|
bin | 10100101011001110… |
… | …010100100100001101 |
3 | 2010022011020102000102 |
4 | 110223032110210031 |
5 | 330431200323041 |
6 | 14110515140445 |
7 | 1414064660126 |
oct | 245316244415 |
9 | 63264212012 |
10 | 22200011021 |
11 | 9462366951 |
12 | 43768a4725 |
13 | 212a4112c6 |
14 | 110856704d |
15 | 89de8b09b |
hex | 52b39490d |
22200011021 has 4 divisors (see below), whose sum is σ = 22428877212. Its totient is φ = 21971144832.
The previous prime is 22200011011. The next prime is 22200011107. The reversal of 22200011021 is 12011000222.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10177984996 + 12022026025 = 100886^2 + 109645^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22200011021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22200010993 and 22200011011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200011011) 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, 114432950 + ... + 114433143.
It is an arithmetic number, because the mean of its divisors is an integer number (5607219303).
Almost surely, 222200011021 is an apocalyptic number.
It is an amenable number.
22200011021 is a deficient number, since it is larger than the sum of its proper divisors (228866191).
22200011021 is an equidigital number, since it uses as much as digits as its factorization.
22200011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228866190.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 22200011021 its reverse (12011000222), we get a palindrome (34211011243).
The spelling of 22200011021 in words is "twenty-two billion, two hundred million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •