Base | Representation |
---|---|
bin | 10100101101111000… |
… | …11111110000000000 |
3 | 1001201010201020010000 |
4 | 22112330133300000 |
5 | 140234312010210 |
6 | 5035355040000 |
7 | 542423430153 |
oct | 122674376000 |
9 | 31633636100 |
10 | 11122375680 |
11 | 4798322519 |
12 | 21a4a40000 |
13 | 10833a39b0 |
14 | 777247c9a |
15 | 4516b3ac0 |
hex | 296f1fc00 |
11122375680 has 440 divisors, whose sum is σ = 42942981312. Its totient is φ = 2736488448.
The previous prime is 11122375679. The next prime is 11122375687. The reversal of 11122375680 is 8657322111.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122375687) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5390329 + ... + 5392391.
Almost surely, 211122375680 is an apocalyptic number.
11122375680 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 11122375680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21471490656).
11122375680 is an abundant number, since it is smaller than the sum of its proper divisors (31820605632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122375680 is a wasteful number, since it uses less digits than its factorization.
11122375680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2113 (or 2086 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
Adding to 11122375680 its reverse (8657322111), we get a palindrome (19779697791).
The spelling of 11122375680 in words is "eleven billion, one hundred twenty-two million, three hundred seventy-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •