Base | Representation |
---|---|
bin | 1100100000010001010… |
… | …0001101011000000000 |
3 | 202112111020011212200000 |
4 | 3020010110031120000 |
5 | 12004423104140303 |
6 | 242404242400000 |
7 | 21343313266602 |
oct | 3100424153000 |
9 | 675436155600 |
10 | 214820771328 |
11 | 831177a8049 |
12 | 35773060000 |
13 | 173469a4457 |
14 | a57c5ad172 |
15 | 58c4683da3 |
hex | 320450d600 |
214820771328 has 480 divisors, whose sum is σ = 687642988032. Its totient is φ = 66786508800.
The previous prime is 214820771327. The next prime is 214820771381. The reversal of 214820771328 is 823177028412.
It is a super-2 number, since 2×2148207713282 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214820771327) 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 47 ways as a sum of consecutive naturals, for example, 117323373 + ... + 117325203.
Almost surely, 2214820771328 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 214820771328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (343821494016).
214820771328 is an abundant number, since it is smaller than the sum of its proper divisors (472822216704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214820771328 is an equidigital number, since it uses as much as digits as its factorization.
214820771328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1928 (or 1900 counting only the distinct ones).
The product of its (nonzero) digits is 301056, while the sum is 45.
The spelling of 214820771328 in words is "two hundred fourteen billion, eight hundred twenty million, seven hundred seventy-one thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •