Base | Representation |
---|---|
bin | 1001011101100111100001… |
… | …1011101101010011110111 |
3 | 1100211122122201010000111200 |
4 | 2113121320123231103313 |
5 | 2330431233404222221 |
6 | 34043421343503543 |
7 | 2122460336011440 |
oct | 227317033552367 |
9 | 40748581100450 |
10 | 10404431320311 |
11 | 3351549267a06 |
12 | 1200546bb7bb3 |
13 | 5a6197874792 |
14 | 27d811a402c7 |
15 | 13099a8b0426 |
hex | 976786ed4f7 |
10404431320311 has 96 divisors (see below), whose sum is σ = 18612212636160. Its totient is φ = 5464533860352.
The previous prime is 10404431320301. The next prime is 10404431320313. The reversal of 10404431320311 is 11302313440401.
10404431320311 is a `hidden beast` number, since 1 + 0 + 4 + 0 + 443 + 1 + 3 + 203 + 11 = 666.
It is not a de Polignac number, because 10404431320311 - 25 = 10404431320279 is a prime.
It is a super-2 number, since 2×104044313203112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10404431320313) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 300662736 + ... + 300697338.
It is an arithmetic number, because the mean of its divisors is an integer number (193877214960).
Almost surely, 210404431320311 is an apocalyptic number.
10404431320311 is a deficient number, since it is larger than the sum of its proper divisors (8207781315849).
10404431320311 is a wasteful number, since it uses less digits than its factorization.
10404431320311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41205 (or 41202 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 10404431320311 its reverse (11302313440401), we get a palindrome (21706744760712).
The spelling of 10404431320311 in words is "ten trillion, four hundred four billion, four hundred thirty-one million, three hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •