Base | Representation |
---|---|
bin | 1011111010100110001100… |
… | …0110111111011101111011 |
3 | 1201101110210000211201002100 |
4 | 2332221203012333131323 |
5 | 3204122442113430021 |
6 | 43510354330234443 |
7 | 2521352515216623 |
oct | 276514306773573 |
9 | 51343700751070 |
10 | 13101313030011 |
11 | 41a1265722768 |
12 | 1577157285a23 |
13 | 7405aa51589b |
14 | 33416d5d9883 |
15 | 17abddcd7626 |
hex | bea631bf77b |
13101313030011 has 12 divisors (see below), whose sum is σ = 19183353326488. Its totient is φ = 8614561991904.
The previous prime is 13101313029991. The next prime is 13101313030027. The reversal of 13101313030011 is 11003031310131.
13101313030011 is a `hidden beast` number, since 1 + 310 + 1 + 313 + 0 + 30 + 0 + 11 = 666.
It is not a de Polignac number, because 13101313030011 - 218 = 13101312767867 is a prime.
It is a super-2 number, since 2×131013130300112 (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 (13101313030081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9970557205 + ... + 9970558518.
Almost surely, 213101313030011 is an apocalyptic number.
13101313030011 is a deficient number, since it is larger than the sum of its proper divisors (6082040296477).
13101313030011 is a wasteful number, since it uses less digits than its factorization.
13101313030011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19941115802 (or 19941115799 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 13101313030011 its reverse (11003031310131), we get a palindrome (24104344340142).
The spelling of 13101313030011 in words is "thirteen trillion, one hundred one billion, three hundred thirteen million, thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •