Base | Representation |
---|---|
bin | 100001010001… |
… | …111000000000 |
3 | 121102020000221 |
4 | 201101320000 |
5 | 4213131333 |
6 | 510552424 |
7 | 134103211 |
oct | 41217000 |
9 | 17366027 |
10 | 8723968 |
11 | 4a194a0 |
12 | 2b08714 |
13 | 1a65b16 |
14 | 1231408 |
15 | b74d2d |
hex | 851e00 |
8723968 has 40 divisors (see below), whose sum is σ = 19027800. Its totient is φ = 3962880.
The previous prime is 8723951. The next prime is 8723977. The reversal of 8723968 is 8693278.
It is a super-2 number, since 2×87239682 = 152215235330048, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4858 + ... + 6406.
It is an arithmetic number, because the mean of its divisors is an integer number (475695).
Almost surely, 28723968 is an apocalyptic number.
8723968 is a gapful number since it is divisible by the number (88) 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 8723968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9513900).
8723968 is an abundant number, since it is smaller than the sum of its proper divisors (10303832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8723968 is a wasteful number, since it uses less digits than its factorization.
8723968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1578 (or 1562 counting only the distinct ones).
The product of its digits is 145152, while the sum is 43.
The square root of 8723968 is about 2953.6364028093. The cubic root of 8723968 is about 205.8597090486.
The spelling of 8723968 in words is "eight million, seven hundred twenty-three thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •