Base | Representation |
---|---|
bin | 111110111001011… |
… | …100001001000111 |
3 | 2201112121222211101 |
4 | 332321130021013 |
5 | 4130120313441 |
6 | 252413320531 |
7 | 35102301442 |
oct | 7671341107 |
9 | 2645558741 |
10 | 1055244871 |
11 | 4a17270aa |
12 | 255496147 |
13 | 13a810965 |
14 | a020c659 |
15 | 62995231 |
hex | 3ee5c247 |
1055244871 has 2 divisors, whose sum is σ = 1055244872. Its totient is φ = 1055244870.
The previous prime is 1055244863. The next prime is 1055244901. The reversal of 1055244871 is 1784425501.
It is a weak prime.
It is an emirp because it is prime and its reverse (1784425501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1055244871 - 23 = 1055244863 is a prime.
It is a super-2 number, since 2×10552448712 = 2227083475543613282, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1055244871.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055244821) 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, 527622435 + 527622436.
It is an arithmetic number, because the mean of its divisors is an integer number (527622436).
Almost surely, 21055244871 is an apocalyptic number.
1055244871 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055244871 is an equidigital number, since it uses as much as digits as its factorization.
1055244871 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44800, while the sum is 37.
The square root of 1055244871 is about 32484.5327963940. The cubic root of 1055244871 is about 1018.0858857757.
The spelling of 1055244871 in words is "one billion, fifty-five million, two hundred forty-four thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •