Base | Representation |
---|---|
bin | 111110111000110… |
… | …000000011111101 |
3 | 2201112021211011012 |
4 | 332320300003331 |
5 | 4130044024232 |
6 | 252405405005 |
7 | 35100620156 |
oct | 7670600375 |
9 | 2645254135 |
10 | 1055064317 |
11 | 4a161348a |
12 | 255409765 |
13 | 13a779718 |
14 | a01a292d |
15 | 6295b9b2 |
hex | 3ee300fd |
1055064317 has 2 divisors, whose sum is σ = 1055064318. Its totient is φ = 1055064316.
The previous prime is 1055064299. The next prime is 1055064347. The reversal of 1055064317 is 7134605501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 824206681 + 230857636 = 28709^2 + 15194^2 .
It is a cyclic number.
It is not a de Polignac number, because 1055064317 - 28 = 1055064061 is a prime.
It is a super-2 number, since 2×10550643172 = 2226321426013352978, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055064347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527532158 + 527532159.
It is an arithmetic number, because the mean of its divisors is an integer number (527532159).
Almost surely, 21055064317 is an apocalyptic number.
It is an amenable number.
1055064317 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055064317 is an equidigital number, since it uses as much as digits as its factorization.
1055064317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The square root of 1055064317 is about 32481.7536010604. The cubic root of 1055064317 is about 1018.0278171167.
Adding to 1055064317 its reverse (7134605501), we get a palindrome (8189669818).
The spelling of 1055064317 in words is "one billion, fifty-five million, sixty-four thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •