Base | Representation |
---|---|
bin | 10100100000100000… |
… | …01100100000000000 |
3 | 1001102022102222201212 |
4 | 22100100030200000 |
5 | 140022041133300 |
6 | 5020304345252 |
7 | 536561204402 |
oct | 122020144000 |
9 | 31368388655 |
10 | 11010099200 |
11 | 473aa06541 |
12 | 2173315228 |
13 | 10660523c9 |
14 | 76637cb72 |
15 | 4468d6935 |
hex | 29040c800 |
11010099200 has 144 divisors (see below), whose sum is σ = 27420120000. Its totient is φ = 4384440320.
The previous prime is 11010099193. The next prime is 11010099203. The reversal of 11010099200 is 299001011.
It is not an unprimeable number, because it can be changed into a prime (11010099203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18380501 + ... + 18381099.
It is an arithmetic number, because the mean of its divisors is an integer number (190417500).
Almost surely, 211010099200 is an apocalyptic number.
11010099200 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 11010099200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13710060000).
11010099200 is an abundant number, since it is smaller than the sum of its proper divisors (16410020800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010099200 is an equidigital number, since it uses as much as digits as its factorization.
11010099200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990 (or 965 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 11010099200 in words is "eleven billion, ten million, ninety-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •