Base | Representation |
---|---|
bin | 111110101111001… |
… | …000000110011001 |
3 | 2201100112122021111 |
4 | 332233020012121 |
5 | 4123422310322 |
6 | 252235340321 |
7 | 35040311431 |
oct | 7657100631 |
9 | 2640478244 |
10 | 1052541337 |
11 | 4a014a981 |
12 | 2545b16a1 |
13 | 13a0a5233 |
14 | 9db072c1 |
15 | 6260e177 |
hex | 3ebc8199 |
1052541337 has 2 divisors, whose sum is σ = 1052541338. Its totient is φ = 1052541336.
The previous prime is 1052541319. The next prime is 1052541353. The reversal of 1052541337 is 7331452501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 916212361 + 136328976 = 30269^2 + 11676^2 .
It is a cyclic number.
It is not a de Polignac number, because 1052541337 - 27 = 1052541209 is a prime.
It is a super-2 number, since 2×10525413372 = 2215686532187495138, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1052541299 and 1052541308.
It is not a weakly prime, because it can be changed into another prime (1052541307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526270668 + 526270669.
It is an arithmetic number, because the mean of its divisors is an integer number (526270669).
Almost surely, 21052541337 is an apocalyptic number.
It is an amenable number.
1052541337 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052541337 is an equidigital number, since it uses as much as digits as its factorization.
1052541337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12600, while the sum is 31.
The square root of 1052541337 is about 32442.8934745346. The cubic root of 1052541337 is about 1017.2156979466.
Adding to 1052541337 its reverse (7331452501), we get a palindrome (8383993838).
The spelling of 1052541337 in words is "one billion, fifty-two million, five hundred forty-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •