Base | Representation |
---|---|
bin | 1100100000100101001… |
… | …1001111001111001000 |
3 | 202112201001112210121012 |
4 | 3020021103033033020 |
5 | 12010111011343023 |
6 | 242420431103052 |
7 | 21345350166440 |
oct | 3101123171710 |
9 | 675631483535 |
10 | 214904402888 |
11 | 8315aa2973a |
12 | 35797071a88 |
13 | 1735b106796 |
14 | a58973d120 |
15 | 58cbba3978 |
hex | 32094cf3c8 |
214904402888 has 96 divisors (see below), whose sum is σ = 498198263040. Its totient is φ = 84838955520.
The previous prime is 214904402851. The next prime is 214904402927. The reversal of 214904402888 is 888204409412.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2051873 + ... + 2154063.
It is an arithmetic number, because the mean of its divisors is an integer number (5189565240).
Almost surely, 2214904402888 is an apocalyptic number.
214904402888 is a gapful number since it is divisible by the number (28) 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 214904402888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (249099131520).
214904402888 is an abundant number, since it is smaller than the sum of its proper divisors (283293860152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214904402888 is a wasteful number, since it uses less digits than its factorization.
214904402888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102315 (or 102264 counting only the distinct ones).
The product of its (nonzero) digits is 1179648, while the sum is 50.
The spelling of 214904402888 in words is "two hundred fourteen billion, nine hundred four million, four hundred two thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •