Base | Representation |
---|---|
bin | 111111100100110… |
… | …001001010010101 |
3 | 2202100000001110122 |
4 | 333210301022111 |
5 | 4141022300112 |
6 | 253501001325 |
7 | 35300656124 |
oct | 7744611225 |
9 | 2670001418 |
10 | 1066603157 |
11 | 4a8084814 |
12 | 259253245 |
13 | 13cc89839 |
14 | a1927abb |
15 | 6398a872 |
hex | 3f931295 |
1066603157 has 2 divisors, whose sum is σ = 1066603158. Its totient is φ = 1066603156.
The previous prime is 1066603129. The next prime is 1066603163. The reversal of 1066603157 is 7513066601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 624300196 + 442302961 = 24986^2 + 21031^2 .
It is an emirp because it is prime and its reverse (7513066601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1066603157 - 210 = 1066602133 is a prime.
It is a super-2 number, since 2×10666031572 = 2275284589044733298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1066603457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 533301578 + 533301579.
It is an arithmetic number, because the mean of its divisors is an integer number (533301579).
Almost surely, 21066603157 is an apocalyptic number.
It is an amenable number.
1066603157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1066603157 is an equidigital number, since it uses as much as digits as its factorization.
1066603157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 22680, while the sum is 35.
The square root of 1066603157 is about 32658.8909334043. The cubic root of 1066603157 is about 1021.7256310987.
Adding to 1066603157 its reverse (7513066601), we get a palindrome (8579669758).
The spelling of 1066603157 in words is "one billion, sixty-six million, six hundred three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •