Base | Representation |
---|---|
bin | 1011111010110001101101… |
… | …0011011100100000000011 |
3 | 1201101202202101201210212101 |
4 | 2332230123103130200003 |
5 | 3204200304221134103 |
6 | 43512025121411231 |
7 | 2521522221131260 |
oct | 276543323344003 |
9 | 51352671653771 |
10 | 13104403302403 |
11 | 41a2601040096 |
12 | 157787a199b17 |
13 | 74098081602a |
14 | 334383bc0267 |
15 | 17ad2025da1d |
hex | beb1b4dc803 |
13104403302403 has 8 divisors (see below), whose sum is σ = 14977281646080. Its totient is φ = 11231730141000.
The previous prime is 13104403302379. The next prime is 13104403302413. The reversal of 13104403302403 is 30420330440131.
13104403302403 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 13104403302403 - 233 = 13095813367811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13104403302413) 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, 51158683 + ... + 51414196.
It is an arithmetic number, because the mean of its divisors is an integer number (1872160205760).
Almost surely, 213104403302403 is an apocalyptic number.
13104403302403 is a deficient number, since it is larger than the sum of its proper divisors (1872878343677).
13104403302403 is a wasteful number, since it uses less digits than its factorization.
13104403302403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102591137.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 13104403302403 its reverse (30420330440131), we get a palindrome (43524733742534).
The spelling of 13104403302403 in words is "thirteen trillion, one hundred four billion, four hundred three million, three hundred two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.261 sec. • engine limits •