Base | Representation |
---|---|
bin | 10101000101110100… |
… | …10001100110000000 |
3 | 1002020010110002112211 |
4 | 22202322101212000 |
5 | 141142204320000 |
6 | 5111325431504 |
7 | 550411634443 |
oct | 124272214600 |
9 | 32203402484 |
10 | 11323120000 |
11 | 4890673715 |
12 | 224010b594 |
13 | 10b5b5ba0a |
14 | 795b8165a |
15 | 4641187ba |
hex | 2a2e91980 |
11323120000 has 80 divisors (see below), whose sum is σ = 28188398700. Its totient is φ = 4529216000.
The previous prime is 11323119991. The next prime is 11323120049. The reversal of 11323120000 is 2132311.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 9231 + ... + 150769.
Almost surely, 211323120000 is an apocalyptic number.
11323120000 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 11323120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14094199350).
11323120000 is an abundant number, since it is smaller than the sum of its proper divisors (16865278700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11323120000 is an frugal number, since it uses more digits than its factorization.
11323120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141573 (or 141546 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 11323120000 its reverse (2132311), we get a palindrome (11325252311).
The spelling of 11323120000 in words is "eleven billion, three hundred twenty-three million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •