Base | Representation |
---|---|
bin | 1101010011111111010100… |
… | …0101010000010101010101 |
3 | 1220211021211020211001022211 |
4 | 3110333311011100111111 |
5 | 3404303202213414023 |
6 | 51044101444553421 |
7 | 3040331060566426 |
oct | 324776505202525 |
9 | 56737736731284 |
10 | 14637065373013 |
11 | 47335a98a7566 |
12 | 17849176b2871 |
13 | 82236698ac25 |
14 | 38861b25364d |
15 | 1a5b24cc3a0d |
hex | d4ff5150555 |
14637065373013 has 2 divisors, whose sum is σ = 14637065373014. Its totient is φ = 14637065373012.
The previous prime is 14637065372953. The next prime is 14637065373053. The reversal of 14637065373013 is 31037356073641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13701235504324 + 935829868689 = 3701518^2 + 967383^2 .
It is an emirp because it is prime and its reverse (31037356073641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14637065373013 - 213 = 14637065364821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14637065373053) 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, 7318532686506 + 7318532686507.
It is an arithmetic number, because the mean of its divisors is an integer number (7318532686507).
Almost surely, 214637065373013 is an apocalyptic number.
It is an amenable number.
14637065373013 is a deficient number, since it is larger than the sum of its proper divisors (1).
14637065373013 is an equidigital number, since it uses as much as digits as its factorization.
14637065373013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2857680, while the sum is 49.
The spelling of 14637065373013 in words is "fourteen trillion, six hundred thirty-seven billion, sixty-five million, three hundred seventy-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •