Base | Representation |
---|---|
bin | 1100101000000000010… |
… | …1011101100000000000 |
3 | 202201211221111110001121 |
4 | 3022000011131200000 |
5 | 12023201200430000 |
6 | 243350301242024 |
7 | 21445626314002 |
oct | 3120005354000 |
9 | 681757443047 |
10 | 216897280000 |
11 | 83a92950815 |
12 | 36052563314 |
13 | 175b7c589cb |
14 | a6d82a2372 |
15 | 5996b0ab1a |
hex | 328015d800 |
216897280000 has 240 divisors, whose sum is σ = 544972428000. Its totient is φ = 86274048000.
The previous prime is 216897279913. The next prime is 216897280049. The reversal of 216897280000 is 82798612.
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 305919646 + ... + 305920354.
It is an arithmetic number, because the mean of its divisors is an integer number (2270718450).
Almost surely, 2216897280000 is an apocalyptic number.
216897280000 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 216897280000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (272486214000).
216897280000 is an abundant number, since it is smaller than the sum of its proper divisors (328075148000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
216897280000 is an frugal number, since it uses more digits than its factorization.
216897280000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990 (or 955 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 43.
The spelling of 216897280000 in words is "two hundred sixteen billion, eight hundred ninety-seven million, two hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •