Base | Representation |
---|---|
bin | 1010000110101111101110… |
… | …0000110010101110000001 |
3 | 1110100012110001100021120112 |
4 | 2201223323200302232001 |
5 | 2424020314301330100 |
6 | 35344154132121105 |
7 | 2224513031046200 |
oct | 241537340625601 |
9 | 43305401307515 |
10 | 11111005105025 |
11 | 35a417279a331 |
12 | 12b5479166195 |
13 | 6279bcc27957 |
14 | 2a5ac0035237 |
15 | 144051b40b35 |
hex | a1afb832b81 |
11111005105025 has 36 divisors (see below), whose sum is σ = 16035087073788. Its totient is φ = 7615158042240.
The previous prime is 11111005105007. The next prime is 11111005105073. The reversal of 11111005105025 is 52050150011111.
It can be written as a sum of positive squares in 6 ways, for example, as 3320788223809 + 7790216881216 = 1822303^2 + 2791096^2 .
It is not a de Polignac number, because 11111005105025 - 212 = 11111005100929 is a prime.
It is a super-2 number, since 2×111110051050252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 175367 + ... + 4717283.
It is an arithmetic number, because the mean of its divisors is an integer number (445419085383).
Almost surely, 211111005105025 is an apocalyptic number.
It is an amenable number.
11111005105025 is a deficient number, since it is larger than the sum of its proper divisors (4924081968763).
11111005105025 is a wasteful number, since it uses less digits than its factorization.
11111005105025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4543938 (or 4543926 counting only the distinct ones).
The product of its (nonzero) digits is 250, while the sum is 23.
Adding to 11111005105025 its reverse (52050150011111), we get a palindrome (63161155116136).
The spelling of 11111005105025 in words is "eleven trillion, one hundred eleven billion, five million, one hundred five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •