Base | Representation |
---|---|
bin | 11110000101001101011001… |
… | …01100100100100111100011 |
3 | 22200012211220112121110022101 |
4 | 33002212230230210213203 |
5 | 32132244030301104141 |
6 | 352404425241351231 |
7 | 16635104644351141 |
oct | 1702465454444743 |
9 | 280184815543271 |
10 | 66149688691171 |
11 | 1a093a1a824788 |
12 | 7504304a98517 |
13 | 2abab72b30417 |
14 | 124993a7dc591 |
15 | 79aa8a125531 |
hex | 3c29acb249e3 |
66149688691171 has 2 divisors, whose sum is σ = 66149688691172. Its totient is φ = 66149688691170.
The previous prime is 66149688691139. The next prime is 66149688691199. The reversal of 66149688691171 is 17119688694166.
66149688691171 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 not a de Polignac number, because 66149688691171 - 25 = 66149688691139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 66149688691094 and 66149688691103.
It is not a weakly prime, because it can be changed into another prime (66149688694171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33074844345585 + 33074844345586.
It is an arithmetic number, because the mean of its divisors is an integer number (33074844345586).
Almost surely, 266149688691171 is an apocalyptic number.
66149688691171 is a deficient number, since it is larger than the sum of its proper divisors (1).
66149688691171 is an equidigital number, since it uses as much as digits as its factorization.
66149688691171 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 188116992, while the sum is 73.
The spelling of 66149688691171 in words is "sixty-six trillion, one hundred forty-nine billion, six hundred eighty-eight million, six hundred ninety-one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •