Base | Representation |
---|---|
bin | 1011111010110000100101… |
… | …1111001110010110110111 |
3 | 1201101201222120022000021112 |
4 | 2332230021133032112313 |
5 | 3204144201211302221 |
6 | 43511535323105235 |
7 | 2521511631403511 |
oct | 276541137162667 |
9 | 51351876260245 |
10 | 13104104400311 |
11 | 41a2468346571 |
12 | 15777b607221b |
13 | 740933910ba2 |
14 | 334356214bb1 |
15 | 17ad03dba15b |
hex | beb097ce5b7 |
13104104400311 has 8 divisors (see below), whose sum is σ = 13209083295264. Its totient is φ = 12999397825440.
The previous prime is 13104104400259. The next prime is 13104104400313. The reversal of 13104104400311 is 11300440140131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13104104400311 is a prime.
It is a super-2 number, since 2×131041044003112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104104400313) 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, 67983395 + ... + 68175876.
It is an arithmetic number, because the mean of its divisors is an integer number (1651135411908).
Almost surely, 213104104400311 is an apocalyptic number.
13104104400311 is a deficient number, since it is larger than the sum of its proper divisors (104978894953).
13104104400311 is a wasteful number, since it uses less digits than its factorization.
13104104400311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136160041.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 13104104400311 its reverse (11300440140131), we get a palindrome (24404544540442).
The spelling of 13104104400311 in words is "thirteen trillion, one hundred four billion, one hundred four million, four hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •