Base | Representation |
---|---|
bin | 101110110001100101110… |
… | …010010101101110011101 |
3 | 102101021210002212122212122 |
4 | 232301211302111232131 |
5 | 410130433331414123 |
6 | 10500352054512325 |
7 | 451141264446155 |
oct | 56614562255635 |
9 | 12337702778778 |
10 | 3214343232413 |
11 | 102a216a58765 |
12 | 43ab650656a5 |
13 | 1a415a5b4941 |
14 | b1809cb9765 |
15 | 5892bee9bc8 |
hex | 2ec65c95b9d |
3214343232413 has 2 divisors, whose sum is σ = 3214343232414. Its totient is φ = 3214343232412.
The previous prime is 3214343232367. The next prime is 3214343232431. The reversal of 3214343232413 is 3142323434123.
Together with next prime (3214343232431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3203734850404 + 10608382009 = 1789898^2 + 102997^2 .
It is a cyclic number.
It is not a de Polignac number, because 3214343232413 - 26 = 3214343232349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3214343232433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1607171616206 + 1607171616207.
It is an arithmetic number, because the mean of its divisors is an integer number (1607171616207).
Almost surely, 23214343232413 is an apocalyptic number.
It is an amenable number.
3214343232413 is a deficient number, since it is larger than the sum of its proper divisors (1).
3214343232413 is an equidigital number, since it uses as much as digits as its factorization.
3214343232413 is an evil number, because the sum of its binary digits is even.
The product of its digits is 124416, while the sum is 35.
Adding to 3214343232413 its reverse (3142323434123), we get a palindrome (6356666666536).
The spelling of 3214343232413 in words is "three trillion, two hundred fourteen billion, three hundred forty-three million, two hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •