Base | Representation |
---|---|
bin | 1010000000110111011110… |
… | …1111100010101010101001 |
3 | 1102222112202112111000201012 |
4 | 2200031313233202222221 |
5 | 2420342000043143423 |
6 | 35225532343233305 |
7 | 2214306212662130 |
oct | 240156757425251 |
9 | 42875675430635 |
10 | 11010010131113 |
11 | 3565356763644 |
12 | 1299992148835 |
13 | 61b31624a966 |
14 | 2a0c5cbb4917 |
15 | 1415e03b9078 |
hex | a0377be2aa9 |
11010010131113 has 8 divisors (see below), whose sum is σ = 13245124969920. Its totient is φ = 8940459354480.
The previous prime is 11010010131103. The next prime is 11010010131119. The reversal of 11010010131113 is 31113101001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11010010131113 - 210 = 11010010130089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010010131119) 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 7 ways as a sum of consecutive naturals, for example, 41391015398 + ... + 41391015663.
It is an arithmetic number, because the mean of its divisors is an integer number (1655640621240).
Almost surely, 211010010131113 is an apocalyptic number.
It is an amenable number.
11010010131113 is a deficient number, since it is larger than the sum of its proper divisors (2235114838807).
11010010131113 is an equidigital number, since it uses as much as digits as its factorization.
11010010131113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82782031087.
The product of its (nonzero) digits is 9, while the sum is 14.
Adding to 11010010131113 its reverse (31113101001011), we get a palindrome (42123111132124).
The spelling of 11010010131113 in words is "eleven trillion, ten billion, ten million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •