Base | Representation |
---|---|
bin | 111100010100101… |
… | …011001001001101 |
3 | 2121112100121010001 |
4 | 330110223021031 |
5 | 4033041140212 |
6 | 244231444301 |
7 | 34036206355 |
oct | 7424531115 |
9 | 2545317101 |
10 | 1012052557 |
11 | 47a30607a |
12 | 242b26691 |
13 | 13189a089 |
14 | 985a7b65 |
15 | 5dcb2657 |
hex | 3c52b24d |
1012052557 has 2 divisors, whose sum is σ = 1012052558. Its totient is φ = 1012052556.
The previous prime is 1012052539. The next prime is 1012052563. The reversal of 1012052557 is 7552502101.
1012052557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 922579876 + 89472681 = 30374^2 + 9459^2 .
It is an emirp because it is prime and its reverse (7552502101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012052557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012052057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506026278 + 506026279.
It is an arithmetic number, because the mean of its divisors is an integer number (506026279).
Almost surely, 21012052557 is an apocalyptic number.
It is an amenable number.
1012052557 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012052557 is an equidigital number, since it uses as much as digits as its factorization.
1012052557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3500, while the sum is 28.
The square root of 1012052557 is about 31812.7734880189. The cubic root of 1012052557 is about 1004.0014857546.
Adding to 1012052557 its reverse (7552502101), we get a palindrome (8564554658).
The spelling of 1012052557 in words is "one billion, twelve million, fifty-two thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •