Base | Representation |
---|---|
bin | 1001111001101100101… |
… | …10100111010011100101 |
3 | 1012112011010020212002001 |
4 | 10330312112213103211 |
5 | 21033224331023323 |
6 | 420143045245301 |
7 | 33402553646044 |
oct | 4746626472345 |
9 | 1175133225061 |
10 | 340214314213 |
11 | 121314124824 |
12 | 55b29103831 |
13 | 2610b40a8c7 |
14 | 12675d7a55b |
15 | 8cb2dcb3ad |
hex | 4f365a74e5 |
340214314213 has 2 divisors, whose sum is σ = 340214314214. Its totient is φ = 340214314212.
The previous prime is 340214314211. The next prime is 340214314217. The reversal of 340214314213 is 312413412043.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 279156892609 + 61057421604 = 528353^2 + 247098^2 .
It is a cyclic number.
It is not a de Polignac number, because 340214314213 - 21 = 340214314211 is a prime.
It is a super-4 number, since 4×3402143142134 (a number of 47 digits) contains 4444 as substring.
Together with 340214314211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (340214314211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 170107157106 + 170107157107.
It is an arithmetic number, because the mean of its divisors is an integer number (170107157107).
Almost surely, 2340214314213 is an apocalyptic number.
It is an amenable number.
340214314213 is a deficient number, since it is larger than the sum of its proper divisors (1).
340214314213 is an equidigital number, since it uses as much as digits as its factorization.
340214314213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 340214314213 its reverse (312413412043), we get a palindrome (652627726256).
The spelling of 340214314213 in words is "three hundred forty billion, two hundred fourteen million, three hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •