Base | Representation |
---|---|
bin | 111110111010011… |
… | …101001000001101 |
3 | 2201120010111221222 |
4 | 332322131020031 |
5 | 4130202323203 |
6 | 252423133125 |
7 | 35104460462 |
oct | 7672351015 |
9 | 2646114858 |
10 | 1055511053 |
11 | 4a1899093 |
12 | 2555a41a5 |
13 | 13a8a4b6c |
14 | a027b669 |
15 | 629e9038 |
hex | 3ee9d20d |
1055511053 has 2 divisors, whose sum is σ = 1055511054. Its totient is φ = 1055511052.
The previous prime is 1055511031. The next prime is 1055511073. The reversal of 1055511053 is 3501155501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 778521604 + 276989449 = 27902^2 + 16643^2 .
It is a cyclic number.
It is not a de Polignac number, because 1055511053 - 226 = 988402189 is a prime.
It is a super-2 number, since 2×10555110532 = 2228207166010337618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055511013) 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, 527755526 + 527755527.
It is an arithmetic number, because the mean of its divisors is an integer number (527755527).
Almost surely, 21055511053 is an apocalyptic number.
It is an amenable number.
1055511053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055511053 is an equidigital number, since it uses as much as digits as its factorization.
1055511053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1875, while the sum is 26.
The square root of 1055511053 is about 32488.6295955985. The cubic root of 1055511053 is about 1018.1714815023.
Adding to 1055511053 its reverse (3501155501), we get a palindrome (4556666554).
The spelling of 1055511053 in words is "one billion, fifty-five million, five hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •