Base | Representation |
---|---|
bin | 10100111010111110… |
… | …11100010110100100 |
3 | 1001222210100212220010 |
4 | 22131133130112210 |
5 | 141000420400400 |
6 | 5054321010220 |
7 | 545226061032 |
oct | 123537342644 |
9 | 31883325803 |
10 | 11232200100 |
11 | 4844314200 |
12 | 2215783970 |
13 | 10a0077164 |
14 | 787a75552 |
15 | 45b159450 |
hex | 29d7dc5a4 |
11232200100 has 216 divisors, whose sum is σ = 36597595104. Its totient is φ = 2656192000.
The previous prime is 11232200027. The next prime is 11232200117. The reversal of 11232200100 is 100223211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1484527 + ... + 1492073.
Almost surely, 211232200100 is an apocalyptic number.
11232200100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11232200100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18298797552).
11232200100 is an abundant number, since it is smaller than the sum of its proper divisors (25365395004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11232200100 is a wasteful number, since it uses less digits than its factorization.
11232200100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7627 (or 7609 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 11232200100 its reverse (100223211), we get a palindrome (11332423311).
The spelling of 11232200100 in words is "eleven billion, two hundred thirty-two million, two hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •