Base | Representation |
---|---|
bin | 1010000001000011000100… |
… | …1010100110110110111010 |
3 | 1102222211210100011002211121 |
4 | 2200100301022212312322 |
5 | 2420414332434324010 |
6 | 35231205152215454 |
7 | 2214446256013150 |
oct | 240206112466672 |
9 | 42884710132747 |
10 | 11013121011130 |
11 | 3566702776867 |
12 | 129a4bbb3a58a |
13 | 61b6c08b4c74 |
14 | 2a10760013d0 |
15 | 1417235613da |
hex | a04312a6dba |
11013121011130 has 256 divisors, whose sum is σ = 24072955232256. Its totient is φ = 3546454855680.
The previous prime is 11013121011119. The next prime is 11013121011133. The reversal of 11013121011130 is 3111012131011.
It is not an unprimeable number, because it can be changed into a prime (11013121011133) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 14247245424 + ... + 14247246196.
It is an arithmetic number, because the mean of its divisors is an integer number (94034981376).
Almost surely, 211013121011130 is an apocalyptic number.
11013121011130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11013121011130 is an abundant number, since it is smaller than the sum of its proper divisors (13059834221126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013121011130 is a wasteful number, since it uses less digits than its factorization.
11013121011130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1541.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 11013121011130 its reverse (3111012131011), we get a palindrome (14124133142141).
The spelling of 11013121011130 in words is "eleven trillion, thirteen billion, one hundred twenty-one million, eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •