Base | Representation |
---|---|
bin | 1111000011011010111110… |
… | …0100010001000000110111 |
3 | 2011121022012022201111210122 |
4 | 3300312233210101000313 |
5 | 4132134334323324114 |
6 | 55111344440042155 |
7 | 3325542321020201 |
oct | 360665744210067 |
9 | 64538168644718 |
10 | 16551454511159 |
11 | 5301483637757 |
12 | 1a3394876335b |
13 | 930a4582c099 |
14 | 413147ad3771 |
15 | 1da81be14e8e |
hex | f0daf911037 |
16551454511159 has 2 divisors, whose sum is σ = 16551454511160. Its totient is φ = 16551454511158.
The previous prime is 16551454511021. The next prime is 16551454511191. The reversal of 16551454511159 is 95111545415561.
16551454511159 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16551454511159 is a prime.
It is a super-2 number, since 2×165514545111592 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16551454511159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16551454591159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8275727255579 + 8275727255580.
It is an arithmetic number, because the mean of its divisors is an integer number (8275727255580).
Almost surely, 216551454511159 is an apocalyptic number.
16551454511159 is a deficient number, since it is larger than the sum of its proper divisors (1).
16551454511159 is an equidigital number, since it uses as much as digits as its factorization.
16551454511159 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2700000, while the sum is 53.
The spelling of 16551454511159 in words is "sixteen trillion, five hundred fifty-one billion, four hundred fifty-four million, five hundred eleven thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •