Base | Representation |
---|---|
bin | 101100011010… |
… | …0110011101000 |
3 | 1121210222222020 |
4 | 1120310303220 |
5 | 21430104333 |
6 | 2151024440 |
7 | 401630130 |
oct | 130646350 |
9 | 47728866 |
10 | 23284968 |
11 | 12164383 |
12 | 796b120 |
13 | 4a936b5 |
14 | 3141ac0 |
15 | 209e3b3 |
hex | 1634ce8 |
23284968 has 128 divisors (see below), whose sum is σ = 72990720. Its totient is φ = 6036480.
The previous prime is 23284889. The next prime is 23284997. The reversal of 23284968 is 86948232.
It is a super-2 number, since 2×232849682 = 1084379469522048, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88405 + ... + 88667.
It is an arithmetic number, because the mean of its divisors is an integer number (570240).
Almost surely, 223284968 is an apocalyptic number.
23284968 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 23284968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36495360).
23284968 is an abundant number, since it is smaller than the sum of its proper divisors (49705752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23284968 is a wasteful number, since it uses less digits than its factorization.
23284968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327 (or 323 counting only the distinct ones).
The product of its digits is 165888, while the sum is 42.
The square root of 23284968 is about 4825.4500308261. The cubic root of 23284968 is about 285.5563892327.
The spelling of 23284968 in words is "twenty-three million, two hundred eighty-four thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •