Base | Representation |
---|---|
bin | 10100101110110110… |
… | …10001101100111000 |
3 | 1001201200220011120220 |
4 | 22113123101230320 |
5 | 140243343211400 |
6 | 5040244020040 |
7 | 542552134542 |
oct | 122733215470 |
9 | 31650804526 |
10 | 11130444600 |
11 | 47a1933850 |
12 | 21a7691620 |
13 | 1084c6a5c2 |
14 | 778348692 |
15 | 4522597a0 |
hex | 2976d1b38 |
11130444600 has 192 divisors, whose sum is σ = 38856084480. Its totient is φ = 2611200000.
The previous prime is 11130444583. The next prime is 11130444653. The reversal of 11130444600 is 644403111.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 177400 + ... + 231800.
It is an arithmetic number, because the mean of its divisors is an integer number (202375440).
Almost surely, 211130444600 is an apocalyptic number.
11130444600 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 11130444600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19428042240).
11130444600 is an abundant number, since it is smaller than the sum of its proper divisors (27725639880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11130444600 is a wasteful number, since it uses less digits than its factorization.
11130444600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54462 (or 54453 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 11130444600 its reverse (644403111), we get a palindrome (11774847711).
The spelling of 11130444600 in words is "eleven billion, one hundred thirty million, four hundred forty-four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •