Base | Representation |
---|---|
bin | 100101111011001101110111… |
… | …111000011111111111110011 |
3 | 210212120122101022222212222112 |
4 | 211323031313320133333303 |
5 | 133330300342424134422 |
6 | 1350425303035555535 |
7 | 50063455536065051 |
oct | 4573156770377763 |
9 | 725518338885875 |
10 | 166797066239987 |
11 | 49168269558077 |
12 | 1685a47bbbbbab |
13 | 720bb8526c601 |
14 | 2d29041bbb1d1 |
15 | 1443b93c8eee2 |
hex | 97b377e1fff3 |
166797066239987 has 2 divisors, whose sum is σ = 166797066239988. Its totient is φ = 166797066239986.
The previous prime is 166797066239977. The next prime is 166797066240011. The reversal of 166797066239987 is 789932660797661.
It is a weak prime.
It is an emirp because it is prime and its reverse (789932660797661) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-166797066239987 is a prime.
It is a super-2 number, since 2×1667970662399872 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 166797066239899 and 166797066239908.
It is not a weakly prime, because it can be changed into another prime (166797066239927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83398533119993 + 83398533119994.
It is an arithmetic number, because the mean of its divisors is an integer number (83398533119994).
Almost surely, 2166797066239987 is an apocalyptic number.
166797066239987 is a deficient number, since it is larger than the sum of its proper divisors (1).
166797066239987 is an equidigital number, since it uses as much as digits as its factorization.
166797066239987 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15554923776, while the sum is 86.
The spelling of 166797066239987 in words is "one hundred sixty-six trillion, seven hundred ninety-seven billion, sixty-six million, two hundred thirty-nine thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •