Base | Representation |
---|---|
bin | 10000101100010110111… |
… | …001101001001010010101 |
3 | 11001122222012012011001011 |
4 | 100230112321221022111 |
5 | 122243320430240324 |
6 | 2234553345332221 |
7 | 145610132114161 |
oct | 20542671511225 |
9 | 4048865164034 |
10 | 1147140477589 |
11 | 402554991587 |
12 | 1663a7037071 |
13 | 842372aa2b2 |
14 | 3d74411bca1 |
15 | 1ec8e29ec94 |
hex | 10b16e69295 |
1147140477589 has 2 divisors, whose sum is σ = 1147140477590. Its totient is φ = 1147140477588.
The previous prime is 1147140477529. The next prime is 1147140477607. The reversal of 1147140477589 is 9857740417411.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 801651622500 + 345488855089 = 895350^2 + 587783^2 .
It is a cyclic number.
It is not a de Polignac number, because 1147140477589 - 211 = 1147140475541 is a prime.
It is a super-2 number, since 2×11471404775892 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1147140477529) 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, 573570238794 + 573570238795.
It is an arithmetic number, because the mean of its divisors is an integer number (573570238795).
Almost surely, 21147140477589 is an apocalyptic number.
It is an amenable number.
1147140477589 is a deficient number, since it is larger than the sum of its proper divisors (1).
1147140477589 is an equidigital number, since it uses as much as digits as its factorization.
1147140477589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7902720, while the sum is 58.
The spelling of 1147140477589 in words is "one trillion, one hundred forty-seven billion, one hundred forty million, four hundred seventy-seven thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •