Base | Representation |
---|---|
bin | 1111001000011010001110… |
… | …0100001011000100010011 |
3 | 2011220111101202121201110102 |
4 | 3302012203210023010103 |
5 | 4140040342020144011 |
6 | 55215000301323015 |
7 | 3334665101660063 |
oct | 362064344130423 |
9 | 64814352551412 |
10 | 16637152506131 |
11 | 533485a950793 |
12 | 1a4848486646b |
13 | 938b522ac351 |
14 | 4173575053a3 |
15 | 1dcb8576373b |
hex | f21a390b113 |
16637152506131 has 2 divisors, whose sum is σ = 16637152506132. Its totient is φ = 16637152506130.
The previous prime is 16637152506119. The next prime is 16637152506133. The reversal of 16637152506131 is 13160525173661.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 16637152506131 - 226 = 16637085397267 is a prime.
It is a super-2 number, since 2×166371525061312 (a number of 27 digits) contains 22 as substring.
Together with 16637152506133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (16637152506133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8318576253065 + 8318576253066.
It is an arithmetic number, because the mean of its divisors is an integer number (8318576253066).
Almost surely, 216637152506131 is an apocalyptic number.
16637152506131 is a deficient number, since it is larger than the sum of its proper divisors (1).
16637152506131 is an equidigital number, since it uses as much as digits as its factorization.
16637152506131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 47.
Adding to 16637152506131 its reverse (13160525173661), we get a palindrome (29797677679792).
The spelling of 16637152506131 in words is "sixteen trillion, six hundred thirty-seven billion, one hundred fifty-two million, five hundred six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •