Base | Representation |
---|---|
bin | 111110110110110… |
… | …110001100010001 |
3 | 2201111100110102001 |
4 | 332312312030101 |
5 | 4124432041022 |
6 | 252350554001 |
7 | 35063440633 |
oct | 7666661421 |
9 | 2644313361 |
10 | 1054565137 |
11 | 4a130243a |
12 | 255208901 |
13 | 13a633452 |
14 | a00b2a53 |
15 | 628adb27 |
hex | 3edb6311 |
1054565137 has 2 divisors, whose sum is σ = 1054565138. Its totient is φ = 1054565136.
The previous prime is 1054565119. The next prime is 1054565147. The reversal of 1054565137 is 7315654501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 530887681 + 523677456 = 23041^2 + 22884^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1054565137 is a prime.
It is a super-2 number, since 2×10545651372 = 2224215256351657538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1054565096 and 1054565105.
It is not a weakly prime, because it can be changed into another prime (1054565107) 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, 527282568 + 527282569.
It is an arithmetic number, because the mean of its divisors is an integer number (527282569).
Almost surely, 21054565137 is an apocalyptic number.
It is an amenable number.
1054565137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054565137 is an equidigital number, since it uses as much as digits as its factorization.
1054565137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63000, while the sum is 37.
The square root of 1054565137 is about 32474.0686856452. The cubic root of 1054565137 is about 1017.8672394523.
The spelling of 1054565137 in words is "one billion, fifty-four million, five hundred sixty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •