Base | Representation |
---|---|
bin | 11001101010010… |
… | …10101100000000 |
3 | 120000001112200202 |
4 | 30311022230000 |
5 | 420101422000 |
6 | 33205504332 |
7 | 5222466560 |
oct | 1465125400 |
9 | 500045622 |
10 | 215264000 |
11 | 100569036 |
12 | 601120a8 |
13 | 3579cb63 |
14 | 20836da0 |
15 | 13d71dd5 |
hex | cd4ab00 |
215264000 has 216 divisors, whose sum is σ = 633263904. Its totient is φ = 71424000.
The previous prime is 215263987. The next prime is 215264009. The reversal of 215264000 is 462512.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (215264009) 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 23 ways as a sum of consecutive naturals, for example, 6943985 + ... + 6944015.
Almost surely, 2215264000 is an apocalyptic number.
215264000 is a gapful number since it is divisible by the number (20) 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 215264000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (316631952).
215264000 is an abundant number, since it is smaller than the sum of its proper divisors (417999904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215264000 is an frugal number, since it uses more digits than its factorization.
215264000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100 (or 45 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 215264000 is about 14671.8778620870. The cubic root of 215264000 is about 599.3177430216.
The spelling of 215264000 in words is "two hundred fifteen million, two hundred sixty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •