Base | Representation |
---|---|
bin | 111111011011111… |
… | …110000010100101 |
3 | 2202011122212111002 |
4 | 333123332002211 |
5 | 4134424442423 |
6 | 253335323045 |
7 | 35242241402 |
oct | 7733760245 |
9 | 2664585432 |
10 | 1064296613 |
11 | 4a6849886 |
12 | 258520485 |
13 | 13c65ca13 |
14 | a14c72a9 |
15 | 63682228 |
hex | 3f6fe0a5 |
1064296613 has 2 divisors, whose sum is σ = 1064296614. Its totient is φ = 1064296612.
The previous prime is 1064296567. The next prime is 1064296627. The reversal of 1064296613 is 3166924601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 854568289 + 209728324 = 29233^2 + 14482^2 .
It is a cyclic number.
It is not a de Polignac number, because 1064296613 - 224 = 1047519397 is a prime.
It is a super-2 number, since 2×10642966132 = 2265454560886543538, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1064296643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532148306 + 532148307.
It is an arithmetic number, because the mean of its divisors is an integer number (532148307).
Almost surely, 21064296613 is an apocalyptic number.
It is an amenable number.
1064296613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1064296613 is an equidigital number, since it uses as much as digits as its factorization.
1064296613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 38.
The square root of 1064296613 is about 32623.5591712492. The cubic root of 1064296613 is about 1020.9886009862.
The spelling of 1064296613 in words is "one billion, sixty-four million, two hundred ninety-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •