Base | Representation |
---|---|
bin | 111110111010110… |
… | …101100110110001 |
3 | 2201120022121111022 |
4 | 332322311212301 |
5 | 4130214030223 |
6 | 252425225225 |
7 | 35105356001 |
oct | 7672654661 |
9 | 2646277438 |
10 | 1055611313 |
11 | 4a1957449 |
12 | 255632215 |
13 | 13a90b6a3 |
14 | a02a6001 |
15 | 62a18ac8 |
hex | 3eeb59b1 |
1055611313 has 2 divisors, whose sum is σ = 1055611314. Its totient is φ = 1055611312.
The previous prime is 1055611307. The next prime is 1055611321. The reversal of 1055611313 is 3131165501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1027010209 + 28601104 = 32047^2 + 5348^2 .
It is a cyclic number.
It is not a de Polignac number, because 1055611313 - 28 = 1055611057 is a prime.
It is a super-3 number, since 3×10556113133 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1055611363) 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, 527805656 + 527805657.
It is an arithmetic number, because the mean of its divisors is an integer number (527805657).
Almost surely, 21055611313 is an apocalyptic number.
It is an amenable number.
1055611313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055611313 is an equidigital number, since it uses as much as digits as its factorization.
1055611313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 26.
The square root of 1055611313 is about 32490.1725603297. The cubic root of 1055611313 is about 1018.2037182217.
Adding to 1055611313 its reverse (3131165501), we get a palindrome (4186776814).
The spelling of 1055611313 in words is "one billion, fifty-five million, six hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •