Base | Representation |
---|---|
bin | 10100101011001110… |
… | …010111011111101110 |
3 | 2010022011021000110220 |
4 | 110223032113133232 |
5 | 330431201214042 |
6 | 14110515312210 |
7 | 1414065040122 |
oct | 245316273756 |
9 | 63264230426 |
10 | 22200023022 |
11 | 9462374971 |
12 | 43768ab666 |
13 | 212a4168c8 |
14 | 110856b582 |
15 | 89de8e8ec |
hex | 52b3977ee |
22200023022 has 8 divisors (see below), whose sum is σ = 44400046056. Its totient is φ = 7400007672.
The previous prime is 22200023003. The next prime is 22200023023. The reversal of 22200023022 is 22032000222.
22200023022 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
22200023022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 22200022992 and 22200023010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200023023) 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, 1850001913 + ... + 1850001924.
It is an arithmetic number, because the mean of its divisors is an integer number (5550005757).
Almost surely, 222200023022 is an apocalyptic number.
22200023022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22200023022 is a wasteful number, since it uses less digits than its factorization.
22200023022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3700003842.
The product of its (nonzero) digits is 192, while the sum is 15.
Adding to 22200023022 its reverse (22032000222), we get a palindrome (44232023244).
The spelling of 22200023022 in words is "twenty-two billion, two hundred million, twenty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •