Base | Representation |
---|---|
bin | 1010001101101111011111… |
… | …0111111000011010101100 |
3 | 1110202200200212010202112010 |
4 | 2203123313313320122230 |
5 | 2433003001000224400 |
6 | 35515313221041220 |
7 | 2236266453324006 |
oct | 243336767703254 |
9 | 43680625122463 |
10 | 11231203133100 |
11 | 364014340a915 |
12 | 1314823256210 |
13 | 6361371588a2 |
14 | 2ab8437a9376 |
15 | 1472391b1450 |
hex | a36f7df86ac |
11231203133100 has 72 divisors (see below), whose sum is σ = 33908467219200. Its totient is φ = 2864770652480.
The previous prime is 11231203133099. The next prime is 11231203133197. The reversal of 11231203133100 is 133130213211.
It is a happy number.
It is a super-2 number, since 2×112312031331002 (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 23 ways as a sum of consecutive naturals, for example, 813848400 + ... + 813862199.
It is an arithmetic number, because the mean of its divisors is an integer number (470950933600).
Almost surely, 211231203133100 is an apocalyptic number.
11231203133100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11231203133100 is an abundant number, since it is smaller than the sum of its proper divisors (22677264086100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11231203133100 is a wasteful number, since it uses less digits than its factorization.
11231203133100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1627710639 (or 1627710632 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11231203133100 its reverse (133130213211), we get a palindrome (11364333346311).
The spelling of 11231203133100 in words is "eleven trillion, two hundred thirty-one billion, two hundred three million, one hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •