Base | Representation |
---|---|
bin | 10100100010100010… |
… | …11011100000000000 |
3 | 1001110111121210121211 |
4 | 22101101123200000 |
5 | 140040430400000 |
6 | 5022115055504 |
7 | 540156440065 |
oct | 122121334000 |
9 | 31414553554 |
10 | 11027200000 |
11 | 4749626633 |
12 | 2178ba1594 |
13 | 106975c01b |
14 | 768750c6c |
15 | 4481637ba |
hex | 29145b800 |
11027200000 has 144 divisors (see below), whose sum is σ = 27575500680. Its totient is φ = 4408320000.
The previous prime is 11027199983. The next prime is 11027200003. The reversal of 11027200000 is 272011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11027200003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6399139 + ... + 6400861.
Almost surely, 211027200000 is an apocalyptic number.
11027200000 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 11027200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13787750340).
11027200000 is an abundant number, since it is smaller than the sum of its proper divisors (16548300680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11027200000 is an frugal number, since it uses more digits than its factorization.
11027200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1770 (or 1730 counting only the distinct ones).
The product of its (nonzero) digits is 28, while the sum is 13.
Adding to 11027200000 its reverse (272011), we get a palindrome (11027472011).
The spelling of 11027200000 in words is "eleven billion, twenty-seven million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •