Base | Representation |
---|---|
bin | 101101100001… |
… | …1001100110000 |
3 | 1122220122000201 |
4 | 1123003030300 |
5 | 22102240313 |
6 | 2211324544 |
7 | 406606420 |
oct | 133031460 |
9 | 48818021 |
10 | 23868208 |
11 | 125225a1 |
12 | 7bb0754 |
13 | 4c39000 |
14 | 3254480 |
15 | 21670dd |
hex | 16c3330 |
23868208 has 80 divisors (see below), whose sum is σ = 57843520. Its totient is φ = 9345024.
The previous prime is 23868193. The next prime is 23868209. The reversal of 23868208 is 80286832.
It is not an unprimeable number, because it can be changed into a prime (23868209) 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 in 15 ways as a sum of consecutive naturals, for example, 246016 + ... + 246112.
It is an arithmetic number, because the mean of its divisors is an integer number (723044).
Almost surely, 223868208 is an apocalyptic number.
23868208 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23868208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28921760).
23868208 is an abundant number, since it is smaller than the sum of its proper divisors (33975312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23868208 is an equidigital number, since it uses as much as digits as its factorization.
23868208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 37.
The square root of 23868208 is about 4885.5100040835. The cubic root of 23868208 is about 287.9209531003.
The spelling of 23868208 in words is "twenty-three million, eight hundred sixty-eight thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •