Base | Representation |
---|---|
bin | 10100100110100010… |
… | …011101101010110001 |
3 | 2010002200022210222012 |
4 | 110212202131222301 |
5 | 330301034430410 |
6 | 14055030252305 |
7 | 1412121561302 |
oct | 244642355261 |
9 | 63080283865 |
10 | 22121405105 |
11 | 9421a58088 |
12 | 43544b7095 |
13 | 211704b627 |
14 | 10dbd447a9 |
15 | 897110605 |
hex | 52689dab1 |
22121405105 has 4 divisors (see below), whose sum is σ = 26545686132. Its totient is φ = 17697124080.
The previous prime is 22121405087. The next prime is 22121405153. The reversal of 22121405105 is 50150412122.
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 12385241521 + 9736163584 = 111289^2 + 98672^2 .
It is not a de Polignac number, because 22121405105 - 212 = 22121401009 is a prime.
It is a super-2 number, since 2×221214051052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2212140506 + ... + 2212140515.
It is an arithmetic number, because the mean of its divisors is an integer number (6636421533).
Almost surely, 222121405105 is an apocalyptic number.
It is an amenable number.
22121405105 is a deficient number, since it is larger than the sum of its proper divisors (4424281027).
22121405105 is an equidigital number, since it uses as much as digits as its factorization.
22121405105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4424281026.
The product of its (nonzero) digits is 800, while the sum is 23.
Adding to 22121405105 its reverse (50150412122), we get a palindrome (72271817227).
The spelling of 22121405105 in words is "twenty-two billion, one hundred twenty-one million, four hundred five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •