Base | Representation |
---|---|
bin | 10100110000101010… |
… | …01010111001011000 |
3 | 1001202202110012210202 |
4 | 22120111022321120 |
5 | 140311234333310 |
6 | 5041545201332 |
7 | 543125134046 |
oct | 123025127130 |
9 | 31682405722 |
10 | 11145621080 |
11 | 47aa45a0a0 |
12 | 21b0790248 |
13 | 1088152379 |
14 | 77a379396 |
15 | 4537563a5 |
hex | 29854ae58 |
11145621080 has 64 divisors (see below), whose sum is σ = 27415065600. Its totient is φ = 4044415360.
The previous prime is 11145621059. The next prime is 11145621101. The reversal of 11145621080 is 8012654111.
It is an interprime number because it is at equal distance from previous prime (11145621059) and next prime (11145621101).
It is a congruent number.
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, 184319 + ... + 237201.
It is an arithmetic number, because the mean of its divisors is an integer number (428360400).
Almost surely, 211145621080 is an apocalyptic number.
11145621080 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 11145621080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13707532800).
11145621080 is an abundant number, since it is smaller than the sum of its proper divisors (16269444520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11145621080 is a wasteful number, since it uses less digits than its factorization.
11145621080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53384 (or 53380 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 29.
The spelling of 11145621080 in words is "eleven billion, one hundred forty-five million, six hundred twenty-one thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •