Base | Representation |
---|---|
bin | 1101010011101010111011… |
… | …0000010101111000011001 |
3 | 1220210202200200220121112221 |
4 | 3110322232300111320121 |
5 | 3404210444133041142 |
6 | 51041354311504041 |
7 | 3040045311234034 |
oct | 324725660257031 |
9 | 56722620817487 |
10 | 14631590518297 |
11 | 473124a448145 |
12 | 178384a088021 |
13 | 8219a363c61c |
14 | 38825c0a401b |
15 | 1a590431e767 |
hex | d4eaec15e19 |
14631590518297 has 2 divisors, whose sum is σ = 14631590518298. Its totient is φ = 14631590518296.
The previous prime is 14631590518219. The next prime is 14631590518313. The reversal of 14631590518297 is 79281509513641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13444109557641 + 1187480960656 = 3666621^2 + 1089716^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14631590518297 is a prime.
It is not a weakly prime, because it can be changed into another prime (14631590518217) 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 as a sum of consecutive naturals, namely, 7315795259148 + 7315795259149.
It is an arithmetic number, because the mean of its divisors is an integer number (7315795259149).
It is a 1-persistent number, because it is pandigital, but 2⋅14631590518297 = 29263181036594 is not.
Almost surely, 214631590518297 is an apocalyptic number.
It is an amenable number.
14631590518297 is a deficient number, since it is larger than the sum of its proper divisors (1).
14631590518297 is an equidigital number, since it uses as much as digits as its factorization.
14631590518297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16329600, while the sum is 61.
The spelling of 14631590518297 in words is "fourteen trillion, six hundred thirty-one billion, five hundred ninety million, five hundred eighteen thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •