Base | Representation |
---|---|
bin | 1100100111000000101… |
… | …0110101001011101110 |
3 | 202201011100001000212200 |
4 | 3021300022311023232 |
5 | 12022124321033040 |
6 | 243304002042330 |
7 | 21436204522335 |
oct | 3116012651356 |
9 | 681140030780 |
10 | 216630252270 |
11 | 83966147943 |
12 | 35b990493a6 |
13 | 17574833a33 |
14 | a6b0a32d1c |
15 | 597d461630 |
hex | 32702b52ee |
216630252270 has 48 divisors (see below), whose sum is σ = 566494411392. Its totient is φ = 57434143680.
The previous prime is 216630252253. The next prime is 216630252301. The reversal of 216630252270 is 72252036612.
216630252270 is a `hidden beast` number, since 2 + 1 + 6 + 63 + 0 + 2 + 522 + 70 = 666.
216630252270 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 an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 6941086 + ... + 6972225.
It is an arithmetic number, because the mean of its divisors is an integer number (11801966904).
Almost surely, 2216630252270 is an apocalyptic number.
216630252270 is an abundant number, since it is smaller than the sum of its proper divisors (349864159122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
216630252270 is a wasteful number, since it uses less digits than its factorization.
216630252270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13913497 (or 13913494 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 36.
Adding to 216630252270 its reverse (72252036612), we get a palindrome (288882288882).
The spelling of 216630252270 in words is "two hundred sixteen billion, six hundred thirty million, two hundred fifty-two thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •