Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11001010101000000 |
3 | 1001102101111221012002 |
4 | 22100110121111000 |
5 | 140022331402240 |
6 | 5020344123132 |
7 | 536603441561 |
oct | 122024312500 |
9 | 31371457162 |
10 | 11011200320 |
11 | 474059885a |
12 | 21737664a8 |
13 | 1066349663 |
14 | 766588168 |
15 | 446a52d15 |
hex | 290519540 |
11011200320 has 112 divisors (see below), whose sum is σ = 27409615488. Its totient is φ = 4205414400.
The previous prime is 11011200293. The next prime is 11011200323. The reversal of 11011200320 is 2300211011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011200323) 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 15 ways as a sum of consecutive naturals, for example, 5791370 + ... + 5793270.
Almost surely, 211011200320 is an apocalyptic number.
11011200320 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 11011200320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13704807744).
11011200320 is an abundant number, since it is smaller than the sum of its proper divisors (16398415168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011200320 is a wasteful number, since it uses less digits than its factorization.
11011200320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2728 (or 2718 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 11011200320 its reverse (2300211011), we get a palindrome (13311411331).
The spelling of 11011200320 in words is "eleven billion, eleven million, two hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •