Base | Representation |
---|---|
bin | 1010000111111100010000… |
… | …1110101010101011100110 |
3 | 1110102011111000210012112012 |
4 | 2201333010032222223212 |
5 | 2424334404411134420 |
6 | 35401433052554222 |
7 | 2226141150410021 |
oct | 241770416525346 |
9 | 43364430705465 |
10 | 11131552443110 |
11 | 3601957178580 |
12 | 12b9452482972 |
13 | 629915b20278 |
14 | 2a6aaccb61b8 |
15 | 144855975dc5 |
hex | a1fc43aaae6 |
11131552443110 has 32 divisors (see below), whose sum is σ = 21866125522464. Its totient is φ = 4046392000000.
The previous prime is 11131552443091. The next prime is 11131552443113. The reversal of 11131552443110 is 1134425513111.
It is a super-2 number, since 2×111315524431102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131552443113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17756141 + ... + 18372360.
It is an arithmetic number, because the mean of its divisors is an integer number (683316422577).
Almost surely, 211131552443110 is an apocalyptic number.
11131552443110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11131552443110 is a deficient number, since it is larger than the sum of its proper divisors (10734573079354).
11131552443110 is a wasteful number, since it uses less digits than its factorization.
11131552443110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36131320.
The product of its (nonzero) digits is 7200, while the sum is 32.
Adding to 11131552443110 its reverse (1134425513111), we get a palindrome (12265977956221).
The spelling of 11131552443110 in words is "eleven trillion, one hundred thirty-one billion, five hundred fifty-two million, four hundred forty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •