Base | Representation |
---|---|
bin | 1100001100101101100100… |
… | …1110000010001100110101 |
3 | 1202111020002102200022001120 |
4 | 3003023121032002030311 |
5 | 3224222331222424023 |
6 | 44305344322014153 |
7 | 2553011023622034 |
oct | 303133116021465 |
9 | 52436072608046 |
10 | 13412532233013 |
11 | 430124a866261 |
12 | 1607531aa7359 |
13 | 763a477ba844 |
14 | 34525478c71b |
15 | 183d563d48e3 |
hex | c32d9382335 |
13412532233013 has 8 divisors (see below), whose sum is σ = 17883402252576. Its totient is φ = 8941675184400.
The previous prime is 13412532232991. The next prime is 13412532233057. The reversal of 13412532233013 is 31033223521431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13412532233013 - 222 = 13412528038709 is a prime.
It is a super-2 number, since 2×134125322330132 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13412532233213) 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, 498103 + ... + 5203188.
It is an arithmetic number, because the mean of its divisors is an integer number (2235425281572).
Almost surely, 213412532233013 is an apocalyptic number.
It is an amenable number.
13412532233013 is a deficient number, since it is larger than the sum of its proper divisors (4470870019563).
13412532233013 is an equidigital number, since it uses as much as digits as its factorization.
13412532233013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6485475.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 13412532233013 its reverse (31033223521431), we get a palindrome (44445755754444).
The spelling of 13412532233013 in words is "thirteen trillion, four hundred twelve billion, five hundred thirty-two million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •