Base | Representation |
---|---|
bin | 10000101100101011110… |
… | …011111000011100011001 |
3 | 11001200212122022012122002 |
4 | 100230223303320130121 |
5 | 122300030232220412 |
6 | 2235052240410345 |
7 | 145621622010434 |
oct | 20545363703431 |
9 | 4050778265562 |
10 | 1147491288857 |
11 | 402714a10251 |
12 | 1664846169b5 |
13 | 84291b88824 |
14 | 3d77895a81b |
15 | 1ecaee98dc2 |
hex | 10b2bcf8719 |
1147491288857 has 4 divisors (see below), whose sum is σ = 1187059954020. Its totient is φ = 1107922623696.
The previous prime is 1147491288847. The next prime is 1147491288863. The reversal of 1147491288857 is 7588821947411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 966005916736 + 181485372121 = 982856^2 + 426011^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1147491288857 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1147491288793 and 1147491288802.
It is not an unprimeable number, because it can be changed into a prime (1147491288817) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19784332538 + ... + 19784332595.
It is an arithmetic number, because the mean of its divisors is an integer number (296764988505).
Almost surely, 21147491288857 is an apocalyptic number.
It is an amenable number.
1147491288857 is a deficient number, since it is larger than the sum of its proper divisors (39568665163).
1147491288857 is an equidigital number, since it uses as much as digits as its factorization.
1147491288857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39568665162.
The product of its digits is 36126720, while the sum is 65.
The spelling of 1147491288857 in words is "one trillion, one hundred forty-seven billion, four hundred ninety-one million, two hundred eighty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •