Base | Representation |
---|---|
bin | 1100011010000011101101… |
… | …0110001110100011100111 |
3 | 1210022010220022122211200210 |
4 | 3012200323112032203213 |
5 | 3242001412311032011 |
6 | 45002543431110503 |
7 | 2605405546122540 |
oct | 306407326164347 |
9 | 53263808584623 |
10 | 13641811814631 |
11 | 438a5071454a0 |
12 | 1643a5b212433 |
13 | 77c556b63a30 |
14 | 3523a53474c7 |
15 | 189cc50ca6a6 |
hex | c683b58e8e7 |
13641811814631 has 64 divisors (see below), whose sum is σ = 24756249369600. Its totient is φ = 6451918064640.
The previous prime is 13641811814629. The next prime is 13641811814639.
13641811814631 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13641811814631 - 21 = 13641811814629 is a prime.
It is a super-2 number, since 2×136418118146312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13641811814639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 30895356 + ... + 31333793.
It is an arithmetic number, because the mean of its divisors is an integer number (386816396400).
Almost surely, 213641811814631 is an apocalyptic number.
13641811814631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13641811814631 is a deficient number, since it is larger than the sum of its proper divisors (11114437554969).
13641811814631 is a wasteful number, since it uses less digits than its factorization.
13641811814631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62229256.
The product of its digits is 331776, while the sum is 48.
The spelling of 13641811814631 in words is "thirteen trillion, six hundred forty-one billion, eight hundred eleven million, eight hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •