Base | Representation |
---|---|
bin | 1010000111100100110010… |
… | …1001110011010110100100 |
3 | 1110101120012220010011010102 |
4 | 2201321030221303112210 |
5 | 2424234003314321200 |
6 | 35354511522043232 |
7 | 2225526045646232 |
oct | 241711451632644 |
9 | 43346186104112 |
10 | 11125251323300 |
11 | 35aa213378a44 |
12 | 12b81941a9518 |
13 | 629150553aca |
14 | 2a66720c1952 |
15 | 1445d76ac6d5 |
hex | a1e4ca735a4 |
11125251323300 has 18 divisors (see below), whose sum is σ = 24141795371778. Its totient is φ = 4450100529280.
The previous prime is 11125251323183. The next prime is 11125251323311. The reversal of 11125251323300 is 332315252111.
It can be written as a sum of positive squares in 3 ways, for example, as 1659340727716 + 9465910595584 = 1288154^2 + 3076672^2 .
It is a super-2 number, since 2×111252513233002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55626256517 + ... + 55626256716.
Almost surely, 211125251323300 is an apocalyptic number.
11125251323300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11125251323300 is an abundant number, since it is smaller than the sum of its proper divisors (13016544048478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11125251323300 is a wasteful number, since it uses less digits than its factorization.
11125251323300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111252513247 (or 111252513240 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 11125251323300 its reverse (332315252111), we get a palindrome (11457566575411).
The spelling of 11125251323300 in words is "eleven trillion, one hundred twenty-five billion, two hundred fifty-one million, three hundred twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •