Base | Representation |
---|---|
bin | 1100011001110010010001… |
… | …1000101010100101110011 |
3 | 1210021200211011000211120102 |
4 | 3012130210120222211303 |
5 | 3241412321143013413 |
6 | 45000451202103015 |
7 | 2605151556053513 |
oct | 306344430524563 |
9 | 53250734024512 |
10 | 13637131610483 |
11 | 4388525302887 |
12 | 1642b7394aa6b |
13 | 77bc8c344474 |
14 | 35207d92d843 |
15 | 189aee293458 |
hex | c672462a973 |
13637131610483 has 2 divisors, whose sum is σ = 13637131610484. Its totient is φ = 13637131610482.
The previous prime is 13637131610461. The next prime is 13637131610489. The reversal of 13637131610483 is 38401613173631.
It is a strong prime.
It is an emirp because it is prime and its reverse (38401613173631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13637131610483 - 230 = 13636057868659 is a prime.
It is a super-2 number, since 2×136371316104832 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13637131610489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6818565805241 + 6818565805242.
It is an arithmetic number, because the mean of its divisors is an integer number (6818565805242).
Almost surely, 213637131610483 is an apocalyptic number.
13637131610483 is a deficient number, since it is larger than the sum of its proper divisors (1).
13637131610483 is an equidigital number, since it uses as much as digits as its factorization.
13637131610483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 47.
The spelling of 13637131610483 in words is "thirteen trillion, six hundred thirty-seven billion, one hundred thirty-one million, six hundred ten thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •