Base | Representation |
---|---|
bin | 1010000001000011000111… |
… | …1001011111010110001011 |
3 | 1102222211211012021111112211 |
4 | 2200100301321133112023 |
5 | 2420414344111114011 |
6 | 35231210311445551 |
7 | 2214446465331103 |
oct | 240206171372613 |
9 | 42884735244484 |
10 | 11013133301131 |
11 | 3566709700495 |
12 | 129a5040868b7 |
13 | 61b6c32c8c60 |
14 | 2a10778c0203 |
15 | 14172468cb21 |
hex | a0431e5f58b |
11013133301131 has 8 divisors (see below), whose sum is σ = 12054728507024. Its totient is φ = 9999313967520.
The previous prime is 11013133301123. The next prime is 11013133301141. The reversal of 11013133301131 is 13110333131011.
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 11013133301131 - 23 = 11013133301123 is a prime.
It is a super-2 number, since 2×110131333011312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11013133301141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6943967241 + ... + 6943968826.
It is an arithmetic number, because the mean of its divisors is an integer number (1506841063378).
Almost surely, 211013133301131 is an apocalyptic number.
11013133301131 is a deficient number, since it is larger than the sum of its proper divisors (1041595205893).
11013133301131 is a wasteful number, since it uses less digits than its factorization.
11013133301131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13887936141.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 11013133301131 its reverse (13110333131011), we get a palindrome (24123466432142).
The spelling of 11013133301131 in words is "eleven trillion, thirteen billion, one hundred thirty-three million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •