Base | Representation |
---|---|
bin | 11001110110110… |
… | …01110011000000 |
3 | 120010010121011010 |
4 | 30323121303000 |
5 | 421011230002 |
6 | 33304520520 |
7 | 5242415610 |
oct | 1473316300 |
9 | 503117133 |
10 | 216898752 |
11 | 101485274 |
12 | 60780140 |
13 | 35c22c75 |
14 | 20b40a40 |
15 | 1409646c |
hex | ced9cc0 |
216898752 has 112 divisors (see below), whose sum is σ = 665390592. Its totient is φ = 61071360.
The previous prime is 216898729. The next prime is 216898753. The reversal of 216898752 is 257898612.
216898752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (216898753) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94288 + ... + 96560.
Almost surely, 2216898752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 216898752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (332695296).
216898752 is an abundant number, since it is smaller than the sum of its proper divisors (448491840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
216898752 is a wasteful number, since it uses less digits than its factorization.
216898752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2366 (or 2356 counting only the distinct ones).
The product of its digits is 483840, while the sum is 48.
The square root of 216898752 is about 14727.4828806555. The cubic root of 216898752 is about 600.8310262387.
The spelling of 216898752 in words is "two hundred sixteen million, eight hundred ninety-eight thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •