Base | Representation |
---|---|
bin | 1100001100001101110111… |
… | …0111100110100010011111 |
3 | 1202110102010012222111121121 |
4 | 3003003131313212202133 |
5 | 3224102413144212111 |
6 | 44301415533511411 |
7 | 2552260055462410 |
oct | 303033567464237 |
9 | 52412105874547 |
10 | 13404020304031 |
11 | 42a8682024005 |
12 | 1605957342567 |
13 | 762cbc1a6a86 |
14 | 344a88105807 |
15 | 183a08eb6871 |
hex | c30ddde689f |
13404020304031 has 32 divisors (see below), whose sum is σ = 15882192046080. Its totient is φ = 11076317740800.
The previous prime is 13404020303983. The next prime is 13404020304041. The reversal of 13404020304031 is 13040302040431.
It is a cyclic number.
It is not a de Polignac number, because 13404020304031 - 227 = 13403886086303 is a prime.
It is a super-2 number, since 2×134040203040312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13404020303987 and 13404020304005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13404020304041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3171216 + ... + 6071626.
It is an arithmetic number, because the mean of its divisors is an integer number (496318501440).
Almost surely, 213404020304031 is an apocalyptic number.
13404020304031 is a deficient number, since it is larger than the sum of its proper divisors (2478171742049).
13404020304031 is a wasteful number, since it uses less digits than its factorization.
13404020304031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2900695.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 13404020304031 its reverse (13040302040431), we get a palindrome (26444322344462).
The spelling of 13404020304031 in words is "thirteen trillion, four hundred four billion, twenty million, three hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •