Base | Representation |
---|---|
bin | 111110110111110… |
… | …011101101110001 |
3 | 2201111211021002101 |
4 | 332313303231301 |
5 | 4130013122022 |
6 | 252400220401 |
7 | 35065540423 |
oct | 7667635561 |
9 | 2644737071 |
10 | 1054817137 |
11 | 4a1464800 |
12 | 25530a701 |
13 | 13a6c106a |
14 | a013a813 |
15 | 6290d627 |
hex | 3edf3b71 |
1054817137 has 12 divisors (see below), whose sum is σ = 1160252100. Its totient is φ = 958242560.
The previous prime is 1054817083. The next prime is 1054817143. The reversal of 1054817137 is 7317184501.
It can be written as a sum of positive squares in 2 ways, for example, as 156975841 + 897841296 = 12529^2 + 29964^2 .
It is not a de Polignac number, because 1054817137 - 27 = 1054817009 is a prime.
It is a super-2 number, since 2×10548171372 = 2225278385017753538, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1054817096 and 1054817105.
It is not an unprimeable number, because it can be changed into a prime (1054817177) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 258489 + ... + 262537.
It is an arithmetic number, because the mean of its divisors is an integer number (96687675).
Almost surely, 21054817137 is an apocalyptic number.
It is an amenable number.
1054817137 is a deficient number, since it is larger than the sum of its proper divisors (105434963).
1054817137 is a wasteful number, since it uses less digits than its factorization.
1054817137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6224 (or 6213 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 37.
The square root of 1054817137 is about 32477.9484727715. The cubic root of 1054817137 is about 1017.9483098723.
The spelling of 1054817137 in words is "one billion, fifty-four million, eight hundred seventeen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •