Base | Representation |
---|---|
bin | 10100110010011000… |
… | …000010110000010110 |
3 | 2010121112000110222111 |
4 | 110302120002300112 |
5 | 331202410000042 |
6 | 14130443021234 |
7 | 1420052604235 |
oct | 246230026026 |
9 | 63545013874 |
10 | 22320000022 |
11 | 9514070411 |
12 | 43aab0a81a |
13 | 2149233208 |
14 | 111a47cb1c |
15 | 8a978d517 |
hex | 532602c16 |
22320000022 has 4 divisors (see below), whose sum is σ = 33480000036. Its totient is φ = 11160000010.
The previous prime is 22320000019. The next prime is 22320000037. The reversal of 22320000022 is 22000002322.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×223200000223 (a number of 32 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (13) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 22319999957 and 22320000011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5580000004 + ... + 5580000007.
It is an arithmetic number, because the mean of its divisors is an integer number (8370000009).
Almost surely, 222320000022 is an apocalyptic number.
22320000022 is a deficient number, since it is larger than the sum of its proper divisors (11160000014).
22320000022 is a wasteful number, since it uses less digits than its factorization.
22320000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11160000013.
The product of its (nonzero) digits is 96, while the sum is 13.
Adding to 22320000022 its reverse (22000002322), we get a palindrome (44320002344).
The spelling of 22320000022 in words is "twenty-two billion, three hundred twenty million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •