Base | Representation |
---|---|
bin | 1011111011010010100001… |
… | …1010001101001010110101 |
3 | 1201102121111100221120002020 |
4 | 2332310220122031022311 |
5 | 3204321330024104023 |
6 | 43520043230303353 |
7 | 2522253434235306 |
oct | 276645032151265 |
9 | 51377440846066 |
10 | 13113213113013 |
11 | 41a6311a3a202 |
12 | 1579518657b59 |
13 | 741755a65610 |
14 | 33497bc487ad |
15 | 17b1888bcde3 |
hex | bed2868d2b5 |
13113213113013 has 32 divisors (see below), whose sum is σ = 18862326336000. Its totient is φ = 8055496253376.
The previous prime is 13113213112973. The next prime is 13113213113017. The reversal of 13113213113013 is 31031131231131.
It is not a de Polignac number, because 13113213113013 - 29 = 13113213112501 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13113213113017) 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 31 ways as a sum of consecutive naturals, for example, 56803006 + ... + 57033392.
It is an arithmetic number, because the mean of its divisors is an integer number (589447698000).
Almost surely, 213113213113013 is an apocalyptic number.
13113213113013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13113213113013 is a deficient number, since it is larger than the sum of its proper divisors (5749113222987).
13113213113013 is a wasteful number, since it uses less digits than its factorization.
13113213113013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232961.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 13113213113013 its reverse (31031131231131), we get a palindrome (44144344344144).
The spelling of 13113213113013 in words is "thirteen trillion, one hundred thirteen billion, two hundred thirteen million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •