Base | Representation |
---|---|
bin | 1011111011000111000000… |
… | …1100000100101010100101 |
3 | 1201102022111222020002110111 |
4 | 2332301300030010222211 |
5 | 3204244012313303141 |
6 | 43514412421453021 |
7 | 2522114024511364 |
oct | 276616014045245 |
9 | 51368458202414 |
10 | 13110122400421 |
11 | 41a4a76351082 |
12 | 15789b5571171 |
13 | 74138263c9b7 |
14 | 33476758b7db |
15 | 17b0573ab381 |
hex | bec70304aa5 |
13110122400421 has 8 divisors (see below), whose sum is σ = 14088489744960. Its totient is φ = 12154775464128.
The previous prime is 13110122400407. The next prime is 13110122400461. The reversal of 13110122400421 is 12400422101131.
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 13110122400421 - 225 = 13110088845989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13110122400392 and 13110122400401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110122400461) 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, 5755100881 + ... + 5755103158.
It is an arithmetic number, because the mean of its divisors is an integer number (1761061218120).
Almost surely, 213110122400421 is an apocalyptic number.
It is an amenable number.
13110122400421 is a deficient number, since it is larger than the sum of its proper divisors (978367344539).
13110122400421 is a wasteful number, since it uses less digits than its factorization.
13110122400421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11510204123.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 13110122400421 its reverse (12400422101131), we get a palindrome (25510544501552).
The spelling of 13110122400421 in words is "thirteen trillion, one hundred ten billion, one hundred twenty-two million, four hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •