Base | Representation |
---|---|
bin | 111110111001011… |
… | …011011110100111 |
3 | 2201112121212002122 |
4 | 332321123132213 |
5 | 4130120222101 |
6 | 252413300155 |
7 | 35102260505 |
oct | 7671333647 |
9 | 2645555078 |
10 | 1055242151 |
11 | 4a1725057 |
12 | 25549465b |
13 | 13a80c652 |
14 | a020b675 |
15 | 6299451b |
hex | 3ee5b7a7 |
1055242151 has 2 divisors, whose sum is σ = 1055242152. Its totient is φ = 1055242150.
The previous prime is 1055242099. The next prime is 1055242171. The reversal of 1055242151 is 1512425501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1055242151 - 214 = 1055225767 is a prime.
It is a super-2 number, since 2×10552421512 = 2227071994494213602, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1055242151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055242171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527621075 + 527621076.
It is an arithmetic number, because the mean of its divisors is an integer number (527621076).
Almost surely, 21055242151 is an apocalyptic number.
1055242151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055242151 is an equidigital number, since it uses as much as digits as its factorization.
1055242151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2000, while the sum is 26.
The square root of 1055242151 is about 32484.4909302886. The cubic root of 1055242151 is about 1018.0850110353.
Adding to 1055242151 its reverse (1512425501), we get a palindrome (2567667652).
The spelling of 1055242151 in words is "one billion, fifty-five million, two hundred forty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •