Base | Representation |
---|---|
bin | 1010000111111000000001… |
… | …0000101100001111100110 |
3 | 1110102001112120001221120010 |
4 | 2201332000100230033212 |
5 | 2424330041000414420 |
6 | 35401123555551050 |
7 | 2226100663013640 |
oct | 241760020541746 |
9 | 43361476057503 |
10 | 11130412123110 |
11 | 3601421524255 |
12 | 12b91945bb486 |
13 | 6297937c31c7 |
14 | 2a6a0167d890 |
15 | 1447da7c84e0 |
hex | a1f8042c3e6 |
11130412123110 has 128 divisors (see below), whose sum is σ = 32099595494400. Its totient is φ = 2416098424320.
The previous prime is 11130412123057. The next prime is 11130412123133. The reversal of 11130412123110 is 1132121403111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14609280 + ... + 15352259.
It is an arithmetic number, because the mean of its divisors is an integer number (250778089800).
Almost surely, 211130412123110 is an apocalyptic number.
11130412123110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11130412123110 is an abundant number, since it is smaller than the sum of its proper divisors (20969183371290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11130412123110 is a wasteful number, since it uses less digits than its factorization.
11130412123110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29961646.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11130412123110 its reverse (1132121403111), we get a palindrome (12262533526221).
The spelling of 11130412123110 in words is "eleven trillion, one hundred thirty billion, four hundred twelve million, one hundred twenty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •