Base | Representation |
---|---|
bin | 1100101010101010… |
… | …1111000011011001 |
3 | 22202222002002002111 |
4 | 3022222233003121 |
5 | 23430422403114 |
6 | 1321222032321 |
7 | 150155140504 |
oct | 31252570331 |
9 | 8688062074 |
10 | 3400200409 |
11 | 1495362991 |
12 | 7aa8786a1 |
13 | 422596108 |
14 | 24382013b |
15 | 14d796bc4 |
hex | caaaf0d9 |
3400200409 has 2 divisors, whose sum is σ = 3400200410. Its totient is φ = 3400200408.
The previous prime is 3400200389. The next prime is 3400200421. The reversal of 3400200409 is 9040020043.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3382585600 + 17614809 = 58160^2 + 4197^2 .
It is a cyclic number.
It is not a de Polignac number, because 3400200409 - 27 = 3400200281 is a prime.
It is a super-2 number, since 2×34002004092 = 23122725642727534562, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3400200409.
It is not a weakly prime, because it can be changed into another prime (3400200449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1700100204 + 1700100205.
It is an arithmetic number, because the mean of its divisors is an integer number (1700100205).
Almost surely, 23400200409 is an apocalyptic number.
It is an amenable number.
3400200409 is a deficient number, since it is larger than the sum of its proper divisors (1).
3400200409 is an equidigital number, since it uses as much as digits as its factorization.
3400200409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 3400200409 is about 58311.2374161276. The cubic root of 3400200409 is about 1503.7241401275.
The spelling of 3400200409 in words is "three billion, four hundred million, two hundred thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •