Base | Representation |
---|---|
bin | 100011110001010101101100… |
… | …1011010000010000110110101 |
3 | 1112021001201002112222221102122 |
4 | 1013202223121122002012311 |
5 | 312220113123040304423 |
6 | 3033105342501445325 |
7 | 123163206412613051 |
oct | 10742533132020665 |
9 | 1467051075887378 |
10 | 314644361650613 |
11 | 91289a19432375 |
12 | 2b358228110845 |
13 | 10674ab3892367 |
14 | 579ac22acac61 |
15 | 265994de728c8 |
hex | 11e2ad96821b5 |
314644361650613 has 2 divisors, whose sum is σ = 314644361650614. Its totient is φ = 314644361650612.
The previous prime is 314644361650579. The next prime is 314644361650627. The reversal of 314644361650613 is 316056163446413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195793330508689 + 118851031141924 = 13992617^2 + 10901882^2 .
It is a cyclic number.
It is not a de Polignac number, because 314644361650613 - 220 = 314644360602037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (314644361650313) 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, 157322180825306 + 157322180825307.
It is an arithmetic number, because the mean of its divisors is an integer number (157322180825307).
Almost surely, 2314644361650613 is an apocalyptic number.
It is an amenable number.
314644361650613 is a deficient number, since it is larger than the sum of its proper divisors (1).
314644361650613 is an equidigital number, since it uses as much as digits as its factorization.
314644361650613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11197440, while the sum is 53.
The spelling of 314644361650613 in words is "three hundred fourteen trillion, six hundred forty-four billion, three hundred sixty-one million, six hundred fifty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •