Base | Representation |
---|---|
bin | 10101000101100110… |
… | …00000000010101100 |
3 | 1002012222212012202220 |
4 | 22202303000002230 |
5 | 141141212304400 |
6 | 5111220515340 |
7 | 550356503121 |
oct | 124263000254 |
9 | 32188765686 |
10 | 11321213100 |
11 | 488a590a6a |
12 | 223b54bb50 |
13 | 10b5641a82 |
14 | 795806748 |
15 | 463d8d7a0 |
hex | 2a2cc00ac |
11321213100 has 36 divisors (see below), whose sum is σ = 32756044104. Its totient is φ = 3018990080.
The previous prime is 11321213083. The next prime is 11321213131. The reversal of 11321213100 is 131212311.
It is a happy number.
It is a super-2 number, since 2×113212131002 (a number of 21 digits) contains 22 as substring.
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 11321213100.
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, 18868389 + ... + 18868988.
It is an arithmetic number, because the mean of its divisors is an integer number (909890114).
Almost surely, 211321213100 is an apocalyptic number.
11321213100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11321213100 is an abundant number, since it is smaller than the sum of its proper divisors (21434831004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11321213100 is a wasteful number, since it uses less digits than its factorization.
11321213100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37737394 (or 37737387 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11321213100 its reverse (131212311), we get a palindrome (11452425411).
The spelling of 11321213100 in words is "eleven billion, three hundred twenty-one million, two hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •