Base | Representation |
---|---|
bin | 1010000111010010111000… |
… | …0100010100010111110100 |
3 | 1110101002210210210212011021 |
4 | 2201310232010110113310 |
5 | 2424144131430311200 |
6 | 35352354443350524 |
7 | 2225265643460641 |
oct | 241645604242764 |
9 | 43332723725137 |
10 | 11120443213300 |
11 | 35a8176314813 |
12 | 12b7271b22444 |
13 | 62886539ccc5 |
14 | 2a63376d0dc8 |
15 | 14440550c41a |
hex | a1d2e1145f4 |
11120443213300 has 72 divisors (see below), whose sum is σ = 24181611144152. Its totient is φ = 4438920960000.
The previous prime is 11120443213277. The next prime is 11120443213333. The reversal of 11120443213300 is 331234402111.
It can be written as a sum of positive squares in 12 ways, for example, as 650261606544 + 10470181606756 = 806388^2 + 3235766^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 148589890 + ... + 148664710.
Almost surely, 211120443213300 is an apocalyptic number.
11120443213300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120443213300 is an abundant number, since it is smaller than the sum of its proper divisors (13061167930852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120443213300 is a wasteful number, since it uses less digits than its factorization.
11120443213300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77909 (or 77902 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11120443213300 its reverse (331234402111), we get a palindrome (11451677615411).
The spelling of 11120443213300 in words is "eleven trillion, one hundred twenty billion, four hundred forty-three million, two hundred thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •