Base | Representation |
---|---|
bin | 1100001100101011101001… |
… | …0011001111001000011101 |
3 | 1202111011202021121002021001 |
4 | 3003022322103033020131 |
5 | 3224220300424044010 |
6 | 44305221031510301 |
7 | 2552662124525455 |
oct | 303127223171035 |
9 | 52434667532231 |
10 | 13412013503005 |
11 | 4301003a76777 |
12 | 1607408228391 |
13 | 7639941a8400 |
14 | 34520591cd65 |
15 | 183d25abbc3a |
hex | c32ba4cf21d |
13412013503005 has 48 divisors (see below), whose sum is σ = 18728256037824. Its totient is φ = 9182523018240.
The previous prime is 13412013502933. The next prime is 13412013503029. The reversal of 13412013503005 is 50030531021431.
It is a happy number.
13412013503005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13412013503005 - 213 = 13412013494813 is a prime.
It is a super-2 number, since 2×134120135030052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6005151 + ... + 7930060.
It is an arithmetic number, because the mean of its divisors is an integer number (390172000788).
Almost surely, 213412013503005 is an apocalyptic number.
It is an amenable number.
13412013503005 is a deficient number, since it is larger than the sum of its proper divisors (5316242534819).
13412013503005 is a wasteful number, since it uses less digits than its factorization.
13412013503005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13935326 (or 13935313 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 13412013503005 its reverse (50030531021431), we get a palindrome (63442544524436).
The spelling of 13412013503005 in words is "thirteen trillion, four hundred twelve billion, thirteen million, five hundred three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •