Base | Representation |
---|---|
bin | 1100001101010110011110… |
… | …1110110000101101101101 |
3 | 1202112021102201010201101021 |
4 | 3003111213232300231231 |
5 | 3224412323324031110 |
6 | 44314402104214141 |
7 | 2553550111554535 |
oct | 303254756605555 |
9 | 52467381121337 |
10 | 13423513111405 |
11 | 4305975223771 |
12 | 160969746a351 |
13 | 764aa777b817 |
14 | 3459b6cc24c5 |
15 | 18429a4482da |
hex | c3567bb0b6d |
13423513111405 has 8 divisors (see below), whose sum is σ = 16119004902552. Its totient is φ = 10731617709888.
The previous prime is 13423513111399. The next prime is 13423513111417. The reversal of 13423513111405 is 50411131532431.
It can be written as a sum of positive squares in 4 ways, for example, as 6658613824041 + 6764899287364 = 2580429^2 + 2600942^2 .
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 13423513111405 - 27 = 13423513111277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 899089194 + ... + 899104123.
It is an arithmetic number, because the mean of its divisors is an integer number (2014875612819).
Almost surely, 213423513111405 is an apocalyptic number.
It is an amenable number.
13423513111405 is a deficient number, since it is larger than the sum of its proper divisors (2695491791147).
13423513111405 is a wasteful number, since it uses less digits than its factorization.
13423513111405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1798194815.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 13423513111405 its reverse (50411131532431), we get a palindrome (63834644643836).
The spelling of 13423513111405 in words is "thirteen trillion, four hundred twenty-three billion, five hundred thirteen million, one hundred eleven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •