Base | Representation |
---|---|
bin | 10100100011001010… |
… | …10101111111001100 |
3 | 1001110212110000112021 |
4 | 22101211111333030 |
5 | 140043244422200 |
6 | 5022423015524 |
7 | 540252011446 |
oct | 122145257714 |
9 | 31425400467 |
10 | 11032420300 |
11 | 4751571730 |
12 | 217a89a5a4 |
13 | 106a869165 |
14 | 76930d496 |
15 | 44884541a |
hex | 291955fcc |
11032420300 has 144 divisors (see below), whose sum is σ = 29109386880. Its totient is φ = 3576960000.
The previous prime is 11032420279. The next prime is 11032420303. The reversal of 11032420300 is 302423011.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (11032420303) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 339775 + ... + 370825.
It is an arithmetic number, because the mean of its divisors is an integer number (202148520).
Almost surely, 211032420300 is an apocalyptic number.
11032420300 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 11032420300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14554693440).
11032420300 is an abundant number, since it is smaller than the sum of its proper divisors (18076966580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11032420300 is a wasteful number, since it uses less digits than its factorization.
11032420300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31112 (or 31105 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 11032420300 its reverse (302423011), we get a palindrome (11334843311).
The spelling of 11032420300 in words is "eleven billion, thirty-two million, four hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.313 sec. • engine limits •