Base | Representation |
---|---|
bin | 101100001010… |
… | …1100110000101 |
3 | 1121120111121022 |
4 | 1120111212011 |
5 | 21412012000 |
6 | 2144200525 |
7 | 400555325 |
oct | 130254605 |
9 | 47514538 |
10 | 23157125 |
11 | 12087322 |
12 | 7909145 |
13 | 4a4a454 |
14 | 310b285 |
15 | 2076585 |
hex | 1615985 |
23157125 has 16 divisors (see below), whose sum is σ = 29383536. Its totient is φ = 18216000.
The previous prime is 23157119. The next prime is 23157137. The reversal of 23157125 is 52175132.
It can be written as a sum of positive squares in 8 ways, for example, as 9972964 + 13184161 = 3158^2 + 3631^2 .
It is not a de Polignac number, because 23157125 - 224 = 6379909 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 = 23157094 and 23157103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6107 + ... + 9143.
It is an arithmetic number, because the mean of its divisors is an integer number (1836471).
Almost surely, 223157125 is an apocalyptic number.
23157125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
23157125 is a deficient number, since it is larger than the sum of its proper divisors (6226411).
23157125 is an equidigital number, since it uses as much as digits as its factorization.
23157125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3113 (or 3103 counting only the distinct ones).
The product of its digits is 2100, while the sum is 26.
The square root of 23157125 is about 4812.1850546295. The cubic root of 23157125 is about 285.0328268333.
The spelling of 23157125 in words is "twenty-three million, one hundred fifty-seven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •