Base | Representation |
---|---|
bin | 10000010001010110100… |
… | …001111101100110110001 |
3 | 10221220010022202212221202 |
4 | 100101112201331212301 |
5 | 121304424132200000 |
6 | 2213400134100545 |
7 | 143532426504545 |
oct | 20212641754661 |
9 | 3856108685852 |
10 | 1118143240625 |
11 | 3a1224789234 |
12 | 160853aaa755 |
13 | 815958abc08 |
14 | 3c192d3da25 |
15 | 1e143700dd5 |
hex | 1045687d9b1 |
1118143240625 has 12 divisors (see below), whose sum is σ = 1397589603228. Its totient is φ = 894514590000.
The previous prime is 1118143240597. The next prime is 1118143240691. The reversal of 1118143240625 is 5260423418111.
It can be written as a sum of positive squares in 6 ways, for example, as 1045266998689 + 72876241936 = 1022383^2 + 269956^2 .
It is not a de Polignac number, because 1118143240625 - 216 = 1118143175089 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 178899794 + ... + 178906043.
It is an arithmetic number, because the mean of its divisors is an integer number (116465800269).
Almost surely, 21118143240625 is an apocalyptic number.
It is an amenable number.
1118143240625 is a deficient number, since it is larger than the sum of its proper divisors (279446362603).
1118143240625 is an frugal number, since it uses more digits than its factorization.
1118143240625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357805862 (or 357805842 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 38.
Adding to 1118143240625 its reverse (5260423418111), we get a palindrome (6378566658736).
The spelling of 1118143240625 in words is "one trillion, one hundred eighteen billion, one hundred forty-three million, two hundred forty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •