Base | Representation |
---|---|
bin | 1010000010111001111111… |
… | …1111110100001100001000 |
3 | 1110002220012012012011022110 |
4 | 2200232133333310030020 |
5 | 2421430223034133300 |
6 | 35254005043022320 |
7 | 2216656342235511 |
oct | 240563777641410 |
9 | 43086165164273 |
10 | 11045045224200 |
11 | 35791a50a3629 |
12 | 12a472b36a9a0 |
13 | 62170a80a880 |
14 | 2a2823c17a08 |
15 | 14249107c550 |
hex | a0b9fff4308 |
11045045224200 has 192 divisors, whose sum is σ = 39042486120960. Its totient is φ = 2558852075520.
The previous prime is 11045045224181. The next prime is 11045045224261. The reversal of 11045045224200 is 242254054011.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 41515384 + ... + 41780583.
It is an arithmetic number, because the mean of its divisors is an integer number (203346281880).
Almost surely, 211045045224200 is an apocalyptic number.
11045045224200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11045045224200 is an abundant number, since it is smaller than the sum of its proper divisors (27997440896760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11045045224200 is a wasteful number, since it uses less digits than its factorization.
11045045224200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83296016 (or 83296007 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 30.
Adding to 11045045224200 its reverse (242254054011), we get a palindrome (11287299278211).
The spelling of 11045045224200 in words is "eleven trillion, forty-five billion, forty-five million, two hundred twenty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •