Base | Representation |
---|---|
bin | 101010010001… |
… | …0111010110101 |
3 | 1112201000002111 |
4 | 1110202322311 |
5 | 21133210000 |
6 | 2111011021 |
7 | 356245345 |
oct | 124427265 |
9 | 45630074 |
10 | 22163125 |
11 | 11568536 |
12 | 7509a71 |
13 | 478cb9a |
14 | 2d2cd25 |
15 | 1e2bcba |
hex | 1522eb5 |
22163125 has 10 divisors (see below), whose sum is σ = 27695822. Its totient is φ = 17730000.
The previous prime is 22163123. The next prime is 22163143. The reversal of 22163125 is 52136122.
It can be written as a sum of positive squares in 5 ways, for example, as 9821956 + 12341169 = 3134^2 + 3513^2 .
It is not a de Polignac number, because 22163125 - 21 = 22163123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22163096 and 22163105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22163123) by changing a digit.
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 in 9 ways as a sum of consecutive naturals, for example, 17106 + ... + 18355.
Almost surely, 222163125 is an apocalyptic number.
22163125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
22163125 is a deficient number, since it is larger than the sum of its proper divisors (5532697).
22163125 is an frugal number, since it uses more digits than its factorization.
22163125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35481 (or 35466 counting only the distinct ones).
The product of its digits is 720, while the sum is 22.
The square root of 22163125 is about 4707.7728279941. The cubic root of 22163125 is about 280.8947778765.
Adding to 22163125 its reverse (52136122), we get a palindrome (74299247).
The spelling of 22163125 in words is "twenty-two million, one hundred sixty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •