Base | Representation |
---|---|
bin | 101010110010… |
… | …0011001011101 |
3 | 1120012121222211 |
4 | 1111210121131 |
5 | 21220300300 |
6 | 2120440421 |
7 | 361443310 |
oct | 125443135 |
9 | 46177884 |
10 | 22431325 |
11 | 11730a94 |
12 | 7619111 |
13 | 4854c97 |
14 | 2d9c977 |
15 | 1e814ba |
hex | 156465d |
22431325 has 24 divisors (see below), whose sum is σ = 33176448. Its totient is φ = 14710080.
The previous prime is 22431323. The next prime is 22431329. The reversal of 22431325 is 52313422.
It is not a de Polignac number, because 22431325 - 21 = 22431323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22431296 and 22431305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22431323) 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 23 ways as a sum of consecutive naturals, for example, 1239 + ... + 6811.
It is an arithmetic number, because the mean of its divisors is an integer number (1382352).
Almost surely, 222431325 is an apocalyptic number.
22431325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
22431325 is a deficient number, since it is larger than the sum of its proper divisors (10745123).
22431325 is a wasteful number, since it uses less digits than its factorization.
22431325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5613 (or 5608 counting only the distinct ones).
The product of its digits is 1440, while the sum is 22.
The square root of 22431325 is about 4736.1719774518. The cubic root of 22431325 is about 282.0232908349.
Adding to 22431325 its reverse (52313422), we get a palindrome (74744747).
The spelling of 22431325 in words is "twenty-two million, four hundred thirty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •