Base | Representation |
---|---|
bin | 110001101001110… |
… | …1110011001000001 |
3 | 11022010002102022001 |
4 | 1203103232121001 |
5 | 11403011141022 |
6 | 433154344001 |
7 | 56200513351 |
oct | 14323563101 |
9 | 4263072261 |
10 | 1666115137 |
11 | 785529a65 |
12 | 3a5b8b001 |
13 | 20724425b |
14 | 11b3c4b61 |
15 | 9b40db27 |
hex | 634ee641 |
1666115137 has 2 divisors, whose sum is σ = 1666115138. Its totient is φ = 1666115136.
The previous prime is 1666115131. The next prime is 1666115179. The reversal of 1666115137 is 7315116661.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1289599921 + 376515216 = 35911^2 + 19404^2 .
It is an emirp because it is prime and its reverse (7315116661) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1666115137 - 211 = 1666113089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1666115096 and 1666115105.
It is not a weakly prime, because it can be changed into another prime (1666115131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 833057568 + 833057569.
It is an arithmetic number, because the mean of its divisors is an integer number (833057569).
Almost surely, 21666115137 is an apocalyptic number.
It is an amenable number.
1666115137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1666115137 is an equidigital number, since it uses as much as digits as its factorization.
1666115137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 22680, while the sum is 37.
The square root of 1666115137 is about 40818.0736561636. The cubic root of 1666115137 is about 1185.5003049227.
The spelling of 1666115137 in words is "one billion, six hundred sixty-six million, one hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •