Base | Representation |
---|---|
bin | 10000111011010000100… |
… | …100111100001101000111 |
3 | 11010012021021002020122200 |
4 | 100323100210330031013 |
5 | 123024102432432011 |
6 | 2250201145525543 |
7 | 150014464150404 |
oct | 20732044741507 |
9 | 4105237066580 |
10 | 1163140514631 |
11 | 409315552197 |
12 | 1695114a38b3 |
13 | 858b7077334 |
14 | 4042109d2ab |
15 | 203c8ca1856 |
hex | 10ed093c347 |
1163140514631 has 12 divisors (see below), whose sum is σ = 1683720568608. Its totient is φ = 773752218624.
The previous prime is 1163140514623. The next prime is 1163140514633. The reversal of 1163140514631 is 1364150413611.
1163140514631 is a `hidden beast` number, since 1 + 1 + 6 + 3 + 1 + 4 + 0 + 5 + 14 + 631 = 666.
It is not a de Polignac number, because 1163140514631 - 23 = 1163140514623 is a prime.
It is a super-2 number, since 2×11631405146312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1163140514633) 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 in 11 ways as a sum of consecutive naturals, for example, 139561530 + ... + 139569863.
It is an arithmetic number, because the mean of its divisors is an integer number (140310047384).
Almost surely, 21163140514631 is an apocalyptic number.
1163140514631 is a deficient number, since it is larger than the sum of its proper divisors (520580053977).
1163140514631 is a wasteful number, since it uses less digits than its factorization.
1163140514631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279131862 (or 279131859 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 1163140514631 in words is "one trillion, one hundred sixty-three billion, one hundred forty million, five hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •