Base | Representation |
---|---|
bin | 10100100110100001… |
… | …101110101000010001 |
3 | 2010002122222000200012 |
4 | 110212201232220101 |
5 | 330301012244213 |
6 | 14055022204305 |
7 | 1412120126465 |
oct | 244641565021 |
9 | 63078860605 |
10 | 22121212433 |
11 | 9421936351 |
12 | 4354423695 |
13 | 2116cb1a18 |
14 | 10dbcd44a5 |
15 | 8970c34a8 |
hex | 52686ea11 |
22121212433 has 8 divisors (see below), whose sum is σ = 22244019048. Its totient is φ = 21998490624.
The previous prime is 22121212423. The next prime is 22121212471. The reversal of 22121212433 is 33421212122.
It can be written as a sum of positive squares in 4 ways, for example, as 13852583809 + 8268628624 = 117697^2 + 90932^2 .
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 22121212433 - 214 = 22121196049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 22121212399 and 22121212408.
It is not an unprimeable number, because it can be changed into a prime (22121212423) 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, 543335 + ... + 582627.
It is an arithmetic number, because the mean of its divisors is an integer number (2780502381).
Almost surely, 222121212433 is an apocalyptic number.
It is an amenable number.
22121212433 is a deficient number, since it is larger than the sum of its proper divisors (122806615).
22121212433 is a wasteful number, since it uses less digits than its factorization.
22121212433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42403.
The product of its digits is 1152, while the sum is 23.
Adding to 22121212433 its reverse (33421212122), we get a palindrome (55542424555).
The spelling of 22121212433 in words is "twenty-two billion, one hundred twenty-one million, two hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •