Base | Representation |
---|---|
bin | 1010010011100000000111… |
… | …0011100111011110110101 |
3 | 1111010011002220201101220021 |
4 | 2210320001303213132311 |
5 | 2441113123413111000 |
6 | 40033000110205141 |
7 | 2246401531161562 |
oct | 244700163473665 |
9 | 44104086641807 |
10 | 11330154035125 |
11 | 36791006380a2 |
12 | 132ba397b37b1 |
13 | 6425764ca4a3 |
14 | 2b254d37b869 |
15 | 149acb26c11a |
hex | a4e01ce77b5 |
11330154035125 has 16 divisors (see below), whose sum is σ = 14971798840752. Its totient is φ = 8530939507200.
The previous prime is 11330154035111. The next prime is 11330154035171. The reversal of 11330154035125 is 52153045103311.
It can be written as a sum of positive squares in 8 ways, for example, as 6387922624356 + 4942231410769 = 2527434^2 + 2223113^2 .
It is not a de Polignac number, because 11330154035125 - 25 = 11330154035093 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2665916472 + ... + 2665920721.
It is an arithmetic number, because the mean of its divisors is an integer number (935737427547).
Almost surely, 211330154035125 is an apocalyptic number.
It is an amenable number.
11330154035125 is a deficient number, since it is larger than the sum of its proper divisors (3641644805627).
11330154035125 is an equidigital number, since it uses as much as digits as its factorization.
11330154035125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5331837225 (or 5331837215 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 34.
Adding to 11330154035125 its reverse (52153045103311), we get a palindrome (63483199138436).
The spelling of 11330154035125 in words is "eleven trillion, three hundred thirty billion, one hundred fifty-four million, thirty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •