Base | Representation |
---|---|
bin | 111111010111011… |
… | …100011100001101 |
3 | 2202002102121022202 |
4 | 333113130130031 |
5 | 4134124013123 |
6 | 253254051245 |
7 | 35226201161 |
oct | 7727343415 |
9 | 2662377282 |
10 | 1063110413 |
11 | 4a6109652 |
12 | 258049b25 |
13 | 13c335b21 |
14 | a1298ca1 |
15 | 634eaa28 |
hex | 3f5dc70d |
1063110413 has 2 divisors, whose sum is σ = 1063110414. Its totient is φ = 1063110412.
The previous prime is 1063110409. The next prime is 1063110421. The reversal of 1063110413 is 3140113601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1060023364 + 3087049 = 32558^2 + 1757^2 .
It is an emirp because it is prime and its reverse (3140113601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1063110413 - 22 = 1063110409 is a prime.
It is a super-2 number, since 2×10631104132 = 2260407500458061138, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1063110473) 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, 531555206 + 531555207.
It is an arithmetic number, because the mean of its divisors is an integer number (531555207).
Almost surely, 21063110413 is an apocalyptic number.
It is an amenable number.
1063110413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1063110413 is an equidigital number, since it uses as much as digits as its factorization.
1063110413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 1063110413 is about 32605.3739895742. The cubic root of 1063110413 is about 1020.6091494685.
The spelling of 1063110413 in words is "one billion, sixty-three million, one hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •