Base | Representation |
---|---|
bin | 1010000111110111001111… |
… | …0011000100101010001000 |
3 | 1110102000222222122000202100 |
4 | 2201331303303010222020 |
5 | 2424324123434012300 |
6 | 35401051130233400 |
7 | 2226062543534310 |
oct | 241756363045210 |
9 | 43360888560670 |
10 | 11130203032200 |
11 | 36013244a214a |
12 | 12b9136585860 |
13 | 62975c3a5085 |
14 | 2a69c19b2440 |
15 | 1447c7275700 |
hex | a1f73cc4a88 |
11130203032200 has 144 divisors (see below), whose sum is σ = 42718779305280. Its totient is φ = 2544046404480.
The previous prime is 11130203032189. The next prime is 11130203032217. The reversal of 11130203032200 is 223030203111.
11130203032200 is a `hidden beast` number, since 1 + 11 + 302 + 0 + 30 + 322 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 441662124 + ... + 441687323.
It is an arithmetic number, because the mean of its divisors is an integer number (296658189620).
Almost surely, 211130203032200 is an apocalyptic number.
11130203032200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11130203032200 is an abundant number, since it is smaller than the sum of its proper divisors (31588576273080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11130203032200 is a wasteful number, since it uses less digits than its factorization.
11130203032200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 883349476 (or 883349464 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 11130203032200 its reverse (223030203111), we get a palindrome (11353233235311).
The spelling of 11130203032200 in words is "eleven trillion, one hundred thirty billion, two hundred three million, thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •