Base | Representation |
---|---|
bin | 100011110001101110010011… |
… | …1110010010000001100110101 |
3 | 1112021020202112002012210002021 |
4 | 1013203130213302100030311 |
5 | 312221444344323331242 |
6 | 3033145523314513141 |
7 | 123200060246254213 |
oct | 10743344762201465 |
9 | 1467222462183067 |
10 | 314697216230197 |
11 | 912aa3814712a9 |
12 | 2b366518b957b1 |
13 | 10679a87b5c018 |
14 | 579d5d85abcb3 |
15 | 265aee4233b67 |
hex | 11e3727c90335 |
314697216230197 has 2 divisors, whose sum is σ = 314697216230198. Its totient is φ = 314697216230196.
The previous prime is 314697216230183. The next prime is 314697216230207. The reversal of 314697216230197 is 791032612796413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 313997903840196 + 699312390001 = 17719986^2 + 836249^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-314697216230197 is a prime.
It is a super-2 number, since 2×3146972162301972 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (314697216236197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157348608115098 + 157348608115099.
It is an arithmetic number, because the mean of its divisors is an integer number (157348608115099).
Almost surely, 2314697216230197 is an apocalyptic number.
It is an amenable number.
314697216230197 is a deficient number, since it is larger than the sum of its proper divisors (1).
314697216230197 is an equidigital number, since it uses as much as digits as its factorization.
314697216230197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20575296, while the sum is 61.
The spelling of 314697216230197 in words is "three hundred fourteen trillion, six hundred ninety-seven billion, two hundred sixteen million, two hundred thirty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •