Base | Representation |
---|---|
bin | 10100100001101110… |
… | …00111101010011000 |
3 | 1001110000122101201101 |
4 | 22100313013222120 |
5 | 140032144144000 |
6 | 5021311201144 |
7 | 540044013160 |
oct | 122067075230 |
9 | 31400571641 |
10 | 11020303000 |
11 | 4745745833 |
12 | 21768161b4 |
13 | 10681b5965 |
14 | 7678775a0 |
15 | 44774ee6a |
hex | 290dc7a98 |
11020303000 has 128 divisors (see below), whose sum is σ = 29580894720. Its totient is φ = 3764361600.
The previous prime is 11020302991. The next prime is 11020303027. The reversal of 11020303000 is 30302011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1978219 + ... + 1983781.
It is an arithmetic number, because the mean of its divisors is an integer number (231100740).
Almost surely, 211020303000 is an apocalyptic number.
11020303000 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 11020303000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14790447360).
11020303000 is an abundant number, since it is smaller than the sum of its proper divisors (18560591720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020303000 is a wasteful number, since it uses less digits than its factorization.
11020303000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5874 (or 5860 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 11020303000 its reverse (30302011), we get a palindrome (11050605011).
The spelling of 11020303000 in words is "eleven billion, twenty million, three hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •