Base | Representation |
---|---|
bin | 1011111010100001010110… |
… | …1000100100101011001001 |
3 | 1201101100102110000000200001 |
4 | 2332220111220210223021 |
5 | 3204112311340212223 |
6 | 43510021334443001 |
7 | 2521305353020051 |
oct | 276502550445311 |
9 | 51340373000601 |
10 | 13100013210313 |
11 | 41a0758a38a07 |
12 | 1576a53b03461 |
13 | 7404311419c3 |
14 | 334088b24561 |
15 | 17ab64b309ad |
hex | bea15a24ac9 |
13100013210313 has 8 divisors (see below), whose sum is σ = 13104172390400. Its totient is φ = 13095854470080.
The previous prime is 13100013210283. The next prime is 13100013210337. The reversal of 13100013210313 is 31301231000131.
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 13100013210313 - 25 = 13100013210281 is a prime.
It is a super-2 number, since 2×131000132103132 (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 (13100013240313) 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, 65597788 + ... + 65797186.
It is an arithmetic number, because the mean of its divisors is an integer number (1638021548800).
Almost surely, 213100013210313 is an apocalyptic number.
It is an amenable number.
13100013210313 is a deficient number, since it is larger than the sum of its proper divisors (4159180087).
13100013210313 is a wasteful number, since it uses less digits than its factorization.
13100013210313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219927.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13100013210313 its reverse (31301231000131), we get a palindrome (44401244210444).
The spelling of 13100013210313 in words is "thirteen trillion, one hundred billion, thirteen million, two hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •