Base | Representation |
---|---|
bin | 10100100000100000… |
… | …10100110000001000 |
3 | 1001102022111201002201 |
4 | 22100100110300020 |
5 | 140022043224000 |
6 | 5020305205544 |
7 | 536561405056 |
oct | 122020246010 |
9 | 31368451081 |
10 | 11010133000 |
11 | 473aa29979 |
12 | 21733308b4 |
13 | 10660648c9 |
14 | 76638b1d6 |
15 | 4468e196a |
hex | 290414c08 |
11010133000 has 64 divisors (see below), whose sum is σ = 25894954800. Its totient is φ = 4381619200.
The previous prime is 11010132983. The next prime is 11010133019. The reversal of 11010133000 is 33101011.
It can be written as a sum of positive squares in 8 ways, for example, as 4829972004 + 6180160996 = 69498^2 + 78614^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 169056 + ... + 224944.
Almost surely, 211010133000 is an apocalyptic number.
11010133000 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 11010133000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12947477400).
11010133000 is an abundant number, since it is smaller than the sum of its proper divisors (14884821800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010133000 is a wasteful number, since it uses less digits than its factorization.
11010133000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56107 (or 56093 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 11010133000 its reverse (33101011), we get a palindrome (11043234011).
The spelling of 11010133000 in words is "eleven billion, ten million, one hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •