Base | Representation |
---|---|
bin | 1100011010000110000100… |
… | …0011011100010110110111 |
3 | 1210022012112102000202110210 |
4 | 3012201201003130112313 |
5 | 3242004211233042011 |
6 | 45003130310120503 |
7 | 2605430330200551 |
oct | 306414103342667 |
9 | 53265472022423 |
10 | 13642444424631 |
11 | 438a801246780 |
12 | 1643bb7050133 |
13 | 77c627c39589 |
14 | 35242537c4d1 |
15 | 189d108da6a6 |
hex | c68610dc5b7 |
13642444424631 has 16 divisors (see below), whose sum is σ = 19847218987008. Its totient is φ = 8266621694400.
The previous prime is 13642444424621. The next prime is 13642444424633.
13642444424631 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13642444424631 - 210 = 13642444423607 is a prime.
It is a super-2 number, since 2×136424444246312 (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 (13642444424633) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37979575 + ... + 38337096.
It is an arithmetic number, because the mean of its divisors is an integer number (1240451186688).
Almost surely, 213642444424631 is an apocalyptic number.
13642444424631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13642444424631 is a deficient number, since it is larger than the sum of its proper divisors (6204774562377).
13642444424631 is a wasteful number, since it uses less digits than its factorization.
13642444424631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76322102.
The product of its digits is 5308416, while the sum is 48.
It can be divided in two parts, 1364244 and 4424631, that added together give a palindrome (5788875).
The spelling of 13642444424631 in words is "thirteen trillion, six hundred forty-two billion, four hundred forty-four million, four hundred twenty-four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •