Base | Representation |
---|---|
bin | 1001001001100000010… |
… | …00110010000110010001 |
3 | 1010001100220120202020121 |
4 | 10210300020302012101 |
5 | 20122232044040304 |
6 | 400223401510241 |
7 | 31465433536651 |
oct | 4446010620621 |
9 | 1101326522217 |
10 | 314340221329 |
11 | 111346950892 |
12 | 50b07aa2381 |
13 | 23846a7ba84 |
14 | 112dd89c361 |
15 | 829b5e8554 |
hex | 4930232191 |
314340221329 has 2 divisors, whose sum is σ = 314340221330. Its totient is φ = 314340221328.
The previous prime is 314340221291. The next prime is 314340221353. The reversal of 314340221329 is 923122043413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 187443970704 + 126896250625 = 432948^2 + 356225^2 .
It is an emirp because it is prime and its reverse (923122043413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 314340221329 - 217 = 314340090257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 314340221294 and 314340221303.
It is not a weakly prime, because it can be changed into another prime (314340224329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157170110664 + 157170110665.
It is an arithmetic number, because the mean of its divisors is an integer number (157170110665).
Almost surely, 2314340221329 is an apocalyptic number.
It is an amenable number.
314340221329 is a deficient number, since it is larger than the sum of its proper divisors (1).
314340221329 is an equidigital number, since it uses as much as digits as its factorization.
314340221329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 314340221329 in words is "three hundred fourteen billion, three hundred forty million, two hundred twenty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •