Base | Representation |
---|---|
bin | 1100001101011010001101… |
… | …0101111010100110010111 |
3 | 1202112101000102001001220012 |
4 | 3003112203111322212113 |
5 | 3224421400341400010 |
6 | 44315045232230435 |
7 | 2553613644465050 |
oct | 303264325724627 |
9 | 52471012031805 |
10 | 13424513231255 |
11 | 43063388195a5 |
12 | 160991639b41b |
13 | 764c06a2b409 |
14 | 345a6da61727 |
15 | 184308150005 |
hex | c35a357a997 |
13424513231255 has 8 divisors (see below), whose sum is σ = 18410761002912. Its totient is φ = 9205380501408.
The previous prime is 13424513231149. The next prime is 13424513231257. The reversal of 13424513231255 is 55213231542431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13424513231255 - 210 = 13424513230231 is a prime.
It is a super-2 number, since 2×134245132312552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13424513231257) 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, 191778760412 + ... + 191778760481.
It is an arithmetic number, because the mean of its divisors is an integer number (2301345125364).
Almost surely, 213424513231255 is an apocalyptic number.
13424513231255 is a deficient number, since it is larger than the sum of its proper divisors (4986247771657).
13424513231255 is an equidigital number, since it uses as much as digits as its factorization.
13424513231255 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 383557520905.
The product of its digits is 432000, while the sum is 41.
Adding to 13424513231255 its reverse (55213231542431), we get a palindrome (68637744773686).
The spelling of 13424513231255 in words is "thirteen trillion, four hundred twenty-four billion, five hundred thirteen million, two hundred thirty-one thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •