Base | Representation |
---|---|
bin | 1001101101010111100… |
… | …0010100000000011101 |
3 | 120221112101002220001002 |
4 | 2123111320110000131 |
5 | 10213100022110034 |
6 | 204343040000045 |
7 | 15023246445641 |
oct | 2332570240035 |
9 | 527471086032 |
10 | 166797066269 |
11 | 648136606a9 |
12 | 283b0000025 |
13 | 129624cc122 |
14 | 8104526c21 |
15 | 451356ce7e |
hex | 26d5e1401d |
166797066269 has 2 divisors, whose sum is σ = 166797066270. Its totient is φ = 166797066268.
The previous prime is 166797066209. The next prime is 166797066281. The reversal of 166797066269 is 962660797661.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128351660644 + 38445405625 = 358262^2 + 196075^2 .
It is an emirp because it is prime and its reverse (962660797661) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 166797066269 - 228 = 166528630813 is a prime.
It is a super-2 number, since 2×1667970662692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (166797066209) 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, 83398533134 + 83398533135.
It is an arithmetic number, because the mean of its divisors is an integer number (83398533135).
Almost surely, 2166797066269 is an apocalyptic number.
It is an amenable number.
166797066269 is a deficient number, since it is larger than the sum of its proper divisors (1).
166797066269 is an equidigital number, since it uses as much as digits as its factorization.
166797066269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61725888, while the sum is 65.
The spelling of 166797066269 in words is "one hundred sixty-six billion, seven hundred ninety-seven million, sixty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •