Base | Representation |
---|---|
bin | 111110111001010… |
… | …100001111111001 |
3 | 2201112120100110211 |
4 | 332321110033321 |
5 | 4130113300122 |
6 | 252412511121 |
7 | 35102105251 |
oct | 7671241771 |
9 | 2645510424 |
10 | 1055212537 |
11 | 4a1704885 |
12 | 25547b4a1 |
13 | 13a7cc022 |
14 | a0200961 |
15 | 6298a877 |
hex | 3ee543f9 |
1055212537 has 2 divisors, whose sum is σ = 1055212538. Its totient is φ = 1055212536.
The previous prime is 1055212517. The next prime is 1055212553. The reversal of 1055212537 is 7352125501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 956726761 + 98485776 = 30931^2 + 9924^2 .
It is a cyclic number.
It is not a de Polignac number, because 1055212537 - 27 = 1055212409 is a prime.
It is a super-2 number, since 2×10552125372 = 2226946996483952738, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1055212499 and 1055212508.
It is not a weakly prime, because it can be changed into another prime (1055212507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527606268 + 527606269.
It is an arithmetic number, because the mean of its divisors is an integer number (527606269).
Almost surely, 21055212537 is an apocalyptic number.
It is an amenable number.
1055212537 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055212537 is an equidigital number, since it uses as much as digits as its factorization.
1055212537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10500, while the sum is 31.
The square root of 1055212537 is about 32484.0351095734. The cubic root of 1055212537 is about 1018.0754872018.
The spelling of 1055212537 in words is "one billion, fifty-five million, two hundred twelve thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •