Base | Representation |
---|---|
bin | 1010000111111100001011… |
… | …1011000000101001110011 |
3 | 1110102011102111112001002022 |
4 | 2201333002323000221303 |
5 | 2424334333302404021 |
6 | 35401430550542055 |
7 | 2226140463121616 |
oct | 241770273005163 |
9 | 43364374461068 |
10 | 11131530513011 |
11 | 360194585a127 |
12 | 12b944706792b |
13 | 62991141248c |
14 | 2a6aaa00817d |
15 | 144853a931ab |
hex | a1fc2ec0a73 |
11131530513011 has 8 divisors (see below), whose sum is σ = 11515426624800. Its totient is φ = 10747637750080.
The previous prime is 11131530512989. The next prime is 11131530513017. The reversal of 11131530513011 is 11031503513111.
11131530513011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11131530513011 - 234 = 11114350643827 is a prime.
It is a super-2 number, since 2×111315305130112 (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 (11131530513017) 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, 7249370 + ... + 8649648.
It is an arithmetic number, because the mean of its divisors is an integer number (1439428328100).
Almost surely, 211131530513011 is an apocalyptic number.
11131530513011 is a deficient number, since it is larger than the sum of its proper divisors (383896111789).
11131530513011 is a wasteful number, since it uses less digits than its factorization.
11131530513011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1674429.
The product of its (nonzero) digits is 675, while the sum is 26.
The spelling of 11131530513011 in words is "eleven trillion, one hundred thirty-one billion, five hundred thirty million, five hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •