Base | Representation |
---|---|
bin | 1100110010000100… |
… | …0010100011110001 |
3 | 22212010102200202222 |
4 | 3030201002203301 |
5 | 24011342311142 |
6 | 1324250450425 |
7 | 151012555211 |
oct | 31441024361 |
9 | 8763380688 |
10 | 3431213297 |
11 | 1500915376 |
12 | 7b9133a15 |
13 | 428b34135 |
14 | 2479b4241 |
15 | 151370bd2 |
hex | cc8428f1 |
3431213297 has 2 divisors, whose sum is σ = 3431213298. Its totient is φ = 3431213296.
The previous prime is 3431213293. The next prime is 3431213311. The reversal of 3431213297 is 7923121343.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2988152896 + 443060401 = 54664^2 + 21049^2 .
It is an emirp because it is prime and its reverse (7923121343) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3431213297 - 22 = 3431213293 is a prime.
It is a super-2 number, since 2×34312132972 = 23546449379019220418, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3431213293) 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, 1715606648 + 1715606649.
It is an arithmetic number, because the mean of its divisors is an integer number (1715606649).
Almost surely, 23431213297 is an apocalyptic number.
It is an amenable number.
3431213297 is a deficient number, since it is larger than the sum of its proper divisors (1).
3431213297 is an equidigital number, since it uses as much as digits as its factorization.
3431213297 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27216, while the sum is 35.
The square root of 3431213297 is about 58576.5592792885. The cubic root of 3431213297 is about 1508.2820830899.
The spelling of 3431213297 in words is "three billion, four hundred thirty-one million, two hundred thirteen thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •