Base | Representation |
---|---|
bin | 1001111001010100110… |
… | …00010100101000010101 |
3 | 1012111122010021011011111 |
4 | 10330222120110220111 |
5 | 21032321414413123 |
6 | 420111111535021 |
7 | 33364564341421 |
oct | 4745230245025 |
9 | 1174563234144 |
10 | 340013435413 |
11 | 1212207a1593 |
12 | 55a9198a471 |
13 | 260a8906602 |
14 | 12657409b81 |
15 | 8ca044b90d |
hex | 4f2a614a15 |
340013435413 has 2 divisors, whose sum is σ = 340013435414. Its totient is φ = 340013435412.
The previous prime is 340013435387. The next prime is 340013435441. The reversal of 340013435413 is 314534310043.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 283968554769 + 56044880644 = 532887^2 + 236738^2 .
It is a cyclic number.
It is not a de Polignac number, because 340013435413 - 25 = 340013435381 is a prime.
It is a super-2 number, since 2×3400134354132 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (340013433413) 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, 170006717706 + 170006717707.
It is an arithmetic number, because the mean of its divisors is an integer number (170006717707).
Almost surely, 2340013435413 is an apocalyptic number.
It is an amenable number.
340013435413 is a deficient number, since it is larger than the sum of its proper divisors (1).
340013435413 is an equidigital number, since it uses as much as digits as its factorization.
340013435413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 340013435413 its reverse (314534310043), we get a palindrome (654547745456).
The spelling of 340013435413 in words is "three hundred forty billion, thirteen million, four hundred thirty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •