Base | Representation |
---|---|
bin | 10100100110101000… |
… | …00110110011111101 |
3 | 1001112220002012012012 |
4 | 22103110012303331 |
5 | 140123213044000 |
6 | 5025341221005 |
7 | 541053553136 |
oct | 122324066375 |
9 | 31486065165 |
10 | 11061456125 |
11 | 47669a3785 |
12 | 2188561765 |
13 | 1073894315 |
14 | 76d10ac8d |
15 | 44b17d735 |
hex | 293506cfd |
11061456125 has 36 divisors (see below), whose sum is σ = 14466367188. Its totient is φ = 8443723200.
The previous prime is 11061456083. The next prime is 11061456127. The reversal of 11061456125 is 52165416011.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 6 ways, for example, as 153115876 + 10908340249 = 12374^2 + 104443^2 .
It is not a de Polignac number, because 11061456125 - 218 = 11061193981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11061456091 and 11061456100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11061456127) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 27044921 + ... + 27045329.
It is an arithmetic number, because the mean of its divisors is an integer number (401843533).
Almost surely, 211061456125 is an apocalyptic number.
It is an amenable number.
11061456125 is a deficient number, since it is larger than the sum of its proper divisors (3404911063).
11061456125 is an frugal number, since it uses more digits than its factorization.
11061456125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 879 (or 437 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 11061456125 in words is "eleven billion, sixty-one million, four hundred fifty-six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •