Base | Representation |
---|---|
bin | 1100100101011010001… |
… | …0010111011011110000 |
3 | 202200001100211211121211 |
4 | 3021112202113123300 |
5 | 12020234223324011 |
6 | 243153200525504 |
7 | 21422433333235 |
oct | 3112642273360 |
9 | 680040754554 |
10 | 216200214256 |
11 | 83765425a24 |
12 | 35a99020894 |
13 | 17506706080 |
14 | a66d88d78c |
15 | 5955817b21 |
hex | 32568976f0 |
216200214256 has 40 divisors (see below), whose sum is σ = 452097372944. Its totient is φ = 99566323200.
The previous prime is 216200214211. The next prime is 216200214257. The reversal of 216200214256 is 652412002612.
216200214256 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (216200214257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1042170 + ... + 1232281.
Almost surely, 2216200214256 is an apocalyptic number.
216200214256 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
216200214256 is an abundant number, since it is smaller than the sum of its proper divisors (235897158688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
216200214256 is a wasteful number, since it uses less digits than its factorization.
216200214256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2274929 (or 2274923 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 216200214256 its reverse (652412002612), we get a palindrome (868612216868).
The spelling of 216200214256 in words is "two hundred sixteen billion, two hundred million, two hundred fourteen thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •