Base | Representation |
---|---|
bin | 100110111110… |
… | …010110101000 |
3 | 201020001220200 |
4 | 212332112220 |
5 | 10103414442 |
6 | 1002552200 |
7 | 152561541 |
oct | 46762650 |
9 | 21201820 |
10 | 10216872 |
11 | 58490a6 |
12 | 3508660 |
13 | 21694b3 |
14 | 14dd4c8 |
15 | d6c34c |
hex | 9be5a8 |
10216872 has 48 divisors (see below), whose sum is σ = 28353780. Its totient is φ = 3321600.
The previous prime is 10216867. The next prime is 10216873. The reversal of 10216872 is 27861201.
It can be written as a sum of positive squares in 2 ways, for example, as 8328996 + 1887876 = 2886^2 + 1374^2 .
It is not an unprimeable number, because it can be changed into a prime (10216873) 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 11 ways as a sum of consecutive naturals, for example, 1222 + ... + 4682.
Almost surely, 210216872 is an apocalyptic number.
10216872 is a gapful number since it is divisible by the number (12) 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 10216872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14176890).
10216872 is an abundant number, since it is smaller than the sum of its proper divisors (18136908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10216872 is a wasteful number, since it uses less digits than its factorization.
10216872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3514 (or 3507 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 10216872 is about 3196.3842071941. The cubic root of 10216872 is about 216.9897989782.
The spelling of 10216872 in words is "ten million, two hundred sixteen thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •