Base | Representation |
---|---|
bin | 100001111000111… |
… | …0111111001100001 |
3 | 2221020202002002200 |
4 | 1003301313321201 |
5 | 4312102204424 |
6 | 304501003413 |
7 | 40115410542 |
oct | 10361677141 |
9 | 2836662080 |
10 | 1137147489 |
11 | 533987815 |
12 | 2789b3569 |
13 | 15178904a |
14 | ab04c4c9 |
15 | 69c728c9 |
hex | 43c77e61 |
1137147489 has 24 divisors (see below), whose sum is σ = 1676698920. Its totient is φ = 742390272.
The previous prime is 1137147481. The next prime is 1137147497. The reversal of 1137147489 is 9847417311.
It is an interprime number because it is at equal distance from previous prime (1137147481) and next prime (1137147497).
It can be written as a sum of positive squares in 4 ways, for example, as 74909025 + 1062238464 = 8655^2 + 32592^2 .
It is not a de Polignac number, because 1137147489 - 23 = 1137147481 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1137147481) 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 in 23 ways as a sum of consecutive naturals, for example, 290457 + ... + 294345.
It is an arithmetic number, because the mean of its divisors is an integer number (69862455).
Almost surely, 21137147489 is an apocalyptic number.
It is an amenable number.
1137147489 is a deficient number, since it is larger than the sum of its proper divisors (539551431).
1137147489 is a wasteful number, since it uses less digits than its factorization.
1137147489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4561 (or 4558 counting only the distinct ones).
The product of its digits is 169344, while the sum is 45.
The square root of 1137147489 is about 33721.6175323782. The cubic root of 1137147489 is about 1043.7718954901.
The spelling of 1137147489 in words is "one billion, one hundred thirty-seven million, one hundred forty-seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •