Base | Representation |
---|---|
bin | 1111001001011000111000… |
… | …1100010001001000000001 |
3 | 2011222002211001211100000001 |
4 | 3302112032030101020001 |
5 | 4140324314242142022 |
6 | 55230421400000001 |
7 | 3336131665336501 |
oct | 362261614211001 |
9 | 64862731740001 |
10 | 16653973787137 |
11 | 5340a02042115 |
12 | 1a4b79a160001 |
13 | 93a60325996b |
14 | 4180b1581a01 |
15 | 1dd31c3d6b27 |
hex | f258e311201 |
16653973787137 has 2 divisors, whose sum is σ = 16653973787138. Its totient is φ = 16653973787136.
The previous prime is 16653973787123. The next prime is 16653973787153. The reversal of 16653973787137 is 73178737935661.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9774101838736 + 6879871948401 = 3126356^2 + 2622951^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16653973787137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16653973787137.
It is not a weakly prime, because it can be changed into another prime (16653970787137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8326986893568 + 8326986893569.
It is an arithmetic number, because the mean of its divisors is an integer number (8326986893569).
Almost surely, 216653973787137 is an apocalyptic number.
It is an amenable number.
16653973787137 is a deficient number, since it is larger than the sum of its proper divisors (1).
16653973787137 is an equidigital number, since it uses as much as digits as its factorization.
16653973787137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 840157920, while the sum is 73.
The spelling of 16653973787137 in words is "sixteen trillion, six hundred fifty-three billion, nine hundred seventy-three million, seven hundred eighty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •