Base | Representation |
---|---|
bin | 111111100011000… |
… | …100100000100001 |
3 | 2202022011102222112 |
4 | 333203010200201 |
5 | 4140414024423 |
6 | 253443245105 |
7 | 35264123456 |
oct | 7743044041 |
9 | 2668142875 |
10 | 1066158113 |
11 | 4a7900409 |
12 | 259079795 |
13 | 13cb620b7 |
14 | a184d82d |
15 | 638eda78 |
hex | 3f8c4821 |
1066158113 has 2 divisors, whose sum is σ = 1066158114. Its totient is φ = 1066158112.
The previous prime is 1066158109. The next prime is 1066158127. The reversal of 1066158113 is 3118516601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 730242529 + 335915584 = 27023^2 + 18328^2 .
It is a cyclic number.
It is not a de Polignac number, because 1066158113 - 22 = 1066158109 is a prime.
It is a super-2 number, since 2×10661581132 = 2273386243831441538, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1066158113.
It is not a weakly prime, because it can be changed into another prime (1066158193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 533079056 + 533079057.
It is an arithmetic number, because the mean of its divisors is an integer number (533079057).
Almost surely, 21066158113 is an apocalyptic number.
It is an amenable number.
1066158113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1066158113 is an equidigital number, since it uses as much as digits as its factorization.
1066158113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 32.
The square root of 1066158113 is about 32652.0767027153. The cubic root of 1066158113 is about 1021.5835050990.
The spelling of 1066158113 in words is "one billion, sixty-six million, one hundred fifty-eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •