Base | Representation |
---|---|
bin | 101101011001… |
… | …0110001100000 |
3 | 1122210012201212 |
4 | 1122302301200 |
5 | 22043112203 |
6 | 2210045252 |
7 | 406206314 |
oct | 132626140 |
9 | 48705655 |
10 | 23800928 |
11 | 12486a98 |
12 | 7b79828 |
13 | 4c144b8 |
14 | 3237b44 |
15 | 21521d8 |
hex | 16b2c60 |
23800928 has 12 divisors (see below), whose sum is σ = 46858140. Its totient is φ = 11900448.
The previous prime is 23800921. The next prime is 23800979. The reversal of 23800928 is 82900832.
It is a happy number.
It is a super-2 number, since 2×238009282 = 1132968347322368, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 743779 = 23800928 / (2 + 3 + 8 + 0 + 0 + 9 + 2 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 23800894 and 23800903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23800921) by changing a digit.
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 as a sum of consecutive naturals, namely, 371858 + ... + 371921.
It is an arithmetic number, because the mean of its divisors is an integer number (3904845).
Almost surely, 223800928 is an apocalyptic number.
It is an amenable number.
23800928 is a deficient number, since it is larger than the sum of its proper divisors (23057212).
23800928 is an equidigital number, since it uses as much as digits as its factorization.
23800928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743789 (or 743781 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 32.
The square root of 23800928 is about 4878.6194768602. The cubic root of 23800928 is about 287.6501667939.
The spelling of 23800928 in words is "twenty-three million, eight hundred thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •