Base | Representation |
---|---|
bin | 110001100010011010110… |
… | …000001111000101011101 |
3 | 110001102212021111212121122 |
4 | 301202122300033011131 |
5 | 421233310332400042 |
6 | 11123512255540325 |
7 | 500642336155043 |
oct | 61423260170535 |
9 | 13042767455548 |
10 | 3404210434397 |
11 | 10a2799051823 |
12 | 46b91322a6a5 |
13 | 1b902855b436 |
14 | baa9c34a393 |
15 | 5d840acd7d2 |
hex | 3189ac0f15d |
3404210434397 has 2 divisors, whose sum is σ = 3404210434398. Its totient is φ = 3404210434396.
The previous prime is 3404210434297. The next prime is 3404210434399. The reversal of 3404210434397 is 7934340124043.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3302721040921 + 101489393476 = 1817339^2 + 318574^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3404210434397 is a prime.
It is a super-2 number, since 2×34042104343972 (a number of 26 digits) contains 22 as substring.
Together with 3404210434399, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3404210434399) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1702105217198 + 1702105217199.
It is an arithmetic number, because the mean of its divisors is an integer number (1702105217199).
Almost surely, 23404210434397 is an apocalyptic number.
It is an amenable number.
3404210434397 is a deficient number, since it is larger than the sum of its proper divisors (1).
3404210434397 is an equidigital number, since it uses as much as digits as its factorization.
3404210434397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 870912, while the sum is 44.
The spelling of 3404210434397 in words is "three trillion, four hundred four billion, two hundred ten million, four hundred thirty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •