Base | Representation |
---|---|
bin | 101101010011… |
… | …1000110100101 |
3 | 1122200210011101 |
4 | 1122213012211 |
5 | 22040100000 |
6 | 2205040101 |
7 | 405620044 |
oct | 132470645 |
9 | 48623141 |
10 | 23753125 |
11 | 12454090 |
12 | 7b56031 |
13 | 4bc8806 |
14 | 322455b |
15 | 2142e6a |
hex | 16a71a5 |
23753125 has 24 divisors (see below), whose sum is σ = 32435424. Its totient is φ = 17250000.
The previous prime is 23753123. The next prime is 23753129. The reversal of 23753125 is 52135732.
It is not a de Polignac number, because 23753125 - 21 = 23753123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23753093 and 23753102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23753123) 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, 34030 + ... + 34720.
It is an arithmetic number, because the mean of its divisors is an integer number (1351476).
Almost surely, 223753125 is an apocalyptic number.
23753125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
23753125 is a deficient number, since it is larger than the sum of its proper divisors (8682299).
23753125 is an frugal number, since it uses more digits than its factorization.
23753125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727 (or 707 counting only the distinct ones).
The product of its digits is 6300, while the sum is 28.
The square root of 23753125 is about 4873.7177800935. The cubic root of 23753125 is about 287.4574606248.
Adding to 23753125 its reverse (52135732), we get a palindrome (75888857).
The spelling of 23753125 in words is "twenty-three million, seven hundred fifty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •