Base | Representation |
---|---|
bin | 10100100101011001… |
… | …01001101011110000 |
3 | 1001112011121201100220 |
4 | 22102230221223300 |
5 | 140113041110300 |
6 | 5024331413040 |
7 | 540566624631 |
oct | 122254515360 |
9 | 31464551326 |
10 | 11051113200 |
11 | 4761079a06 |
12 | 2184bb4180 |
13 | 10716b264a |
14 | 76b9b7888 |
15 | 44a2d8da0 |
hex | 292b29af0 |
11051113200 has 60 divisors (see below), whose sum is σ = 35400403128. Its totient is φ = 2946963200.
The previous prime is 11051113147. The next prime is 11051113217. The reversal of 11051113200 is 231115011.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11051113200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4603431 + ... + 4605830.
Almost surely, 211051113200 is an apocalyptic number.
11051113200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11051113200 is an abundant number, since it is smaller than the sum of its proper divisors (24349289928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11051113200 is a wasteful number, since it uses less digits than its factorization.
11051113200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9209282 (or 9209271 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 11051113200 its reverse (231115011), we get a palindrome (11282228211).
It can be divided in two parts, 11051 and 113200, that added together give a triangular number (124251 = T498).
The spelling of 11051113200 in words is "eleven billion, fifty-one million, one hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •