Base | Representation |
---|---|
bin | 101100010110… |
… | …0111010110010 |
3 | 1121202100122120 |
4 | 1120230322302 |
5 | 21423041113 |
6 | 2150215110 |
7 | 401434002 |
oct | 130547262 |
9 | 47670576 |
10 | 23252658 |
11 | 12142080 |
12 | 7954496 |
13 | 4a81a90 |
14 | 3134002 |
15 | 2094a23 |
hex | 162ceb2 |
23252658 has 64 divisors (see below), whose sum is σ = 56052864. Its totient is φ = 6336000.
The previous prime is 23252657. The next prime is 23252683. The reversal of 23252658 is 85625232.
It is a super-2 number, since 2×232526582 = 1081372208129928, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (23252653) 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 31 ways as a sum of consecutive naturals, for example, 34848 + ... + 35508.
It is an arithmetic number, because the mean of its divisors is an integer number (875826).
Almost surely, 223252658 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23252658, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28026432).
23252658 is an abundant number, since it is smaller than the sum of its proper divisors (32800206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23252658 is a wasteful number, since it uses less digits than its factorization.
23252658 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 731.
The product of its digits is 28800, while the sum is 33.
The square root of 23252658 is about 4822.1009943799. The cubic root of 23252658 is about 285.4242496526.
The spelling of 23252658 in words is "twenty-three million, two hundred fifty-two thousand, six hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •