Base | Representation |
---|---|
bin | 110001000111100111011011… |
… | …110101011111010000001101 |
3 | 1001022220001010221102001001001 |
4 | 301013213123311133100031 |
5 | 211303344121012200421 |
6 | 2043241423003220301 |
7 | 63334324521221404 |
oct | 6107473365372015 |
9 | 1038801127361031 |
10 | 216027658318861 |
11 | 629188a7323084 |
12 | 2028b735817691 |
13 | 937042296232c |
14 | 3b4bb19d8c63b |
15 | 19e95961dc691 |
hex | c479dbd5f40d |
216027658318861 has 2 divisors, whose sum is σ = 216027658318862. Its totient is φ = 216027658318860.
The previous prime is 216027658318757. The next prime is 216027658318903. The reversal of 216027658318861 is 168813856720612.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 208710579218761 + 7317079100100 = 14446819^2 + 2705010^2 .
It is a cyclic number.
It is not a de Polignac number, because 216027658318861 - 215 = 216027658286093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 216027658318793 and 216027658318802.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (216027658358861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 108013829159430 + 108013829159431.
It is an arithmetic number, because the mean of its divisors is an integer number (108013829159431).
Almost surely, 2216027658318861 is an apocalyptic number.
It is an amenable number.
216027658318861 is a deficient number, since it is larger than the sum of its proper divisors (1).
216027658318861 is an equidigital number, since it uses as much as digits as its factorization.
216027658318861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46448640, while the sum is 64.
The spelling of 216027658318861 in words is "two hundred sixteen trillion, twenty-seven billion, six hundred fifty-eight million, three hundred eighteen thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •