Base | Representation |
---|---|
bin | 10100111000010101… |
… | …10010111010111100 |
3 | 1001221020121112012200 |
4 | 22130022302322330 |
5 | 140424230312200 |
6 | 5052205231500 |
7 | 544536341526 |
oct | 123412627274 |
9 | 31836545180 |
10 | 11210010300 |
11 | 4832838725 |
12 | 220a262590 |
13 | 10985a80b8 |
14 | 784b3aa16 |
15 | 459224800 |
hex | 29c2b2ebc |
11210010300 has 108 divisors (see below), whose sum is σ = 35162410920. Its totient is φ = 2987187840.
The previous prime is 11210010283. The next prime is 11210010311. The reversal of 11210010300 is 301001211.
It is a super-2 number, since 2×112100103002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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, 1547086 + ... + 1554314.
Almost surely, 211210010300 is an apocalyptic number.
11210010300 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 11210010300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17581205460).
11210010300 is an abundant number, since it is smaller than the sum of its proper divisors (23952400620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210010300 is a wasteful number, since it uses less digits than its factorization.
11210010300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8972 (or 8962 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 11210010300 its reverse (301001211), we get a palindrome (11511011511).
The spelling of 11210010300 in words is "eleven billion, two hundred ten million, ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •