Base | Representation |
---|---|
bin | 111111000001101… |
… | …100100001110001 |
3 | 2201200200221122101 |
4 | 333001230201301 |
5 | 4131144043022 |
6 | 252531540401 |
7 | 35126554321 |
oct | 7701544161 |
9 | 2650627571 |
10 | 1057409137 |
11 | 4a2975154 |
12 | 25615a701 |
13 | 13b0baaa5 |
14 | a0613281 |
15 | 62c71627 |
hex | 3f06c871 |
1057409137 has 2 divisors, whose sum is σ = 1057409138. Its totient is φ = 1057409136.
The previous prime is 1057409131. The next prime is 1057409159. The reversal of 1057409137 is 7319047501.
1057409137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 772339681 + 285069456 = 27791^2 + 16884^2 .
It is a cyclic number.
It is not a de Polignac number, because 1057409137 - 223 = 1049020529 is a prime.
It is a super-2 number, since 2×10574091372 = 2236228166022169538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1057409096 and 1057409105.
It is not a weakly prime, because it can be changed into another prime (1057409131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528704568 + 528704569.
It is an arithmetic number, because the mean of its divisors is an integer number (528704569).
Almost surely, 21057409137 is an apocalyptic number.
It is an amenable number.
1057409137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1057409137 is an equidigital number, since it uses as much as digits as its factorization.
1057409137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 37.
The square root of 1057409137 is about 32517.8279871212. The cubic root of 1057409137 is about 1018.7814286062.
The spelling of 1057409137 in words is "one billion, fifty-seven million, four hundred nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •