Base | Representation |
---|---|
bin | 1001111001011011001… |
… | …00000010111000101101 |
3 | 1012111202211202101122012 |
4 | 10330231210002320231 |
5 | 21032424102340414 |
6 | 420120300331005 |
7 | 33366113306303 |
oct | 4745544027055 |
9 | 1174684671565 |
10 | 340066840109 |
11 | 1212489582a7 |
12 | 55aa7843a65 |
13 | 260b69b4619 |
14 | 1266054c273 |
15 | 8ca4e9a33e |
hex | 4f2d902e2d |
340066840109 has 2 divisors, whose sum is σ = 340066840110. Its totient is φ = 340066840108.
The previous prime is 340066840081. The next prime is 340066840111. The reversal of 340066840109 is 901048660043.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 323053550884 + 17013289225 = 568378^2 + 130435^2 .
It is a cyclic number.
It is not a de Polignac number, because 340066840109 - 216 = 340066774573 is a prime.
It is a super-2 number, since 2×3400668401092 (a number of 24 digits) contains 22 as substring.
Together with 340066840111, 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 (340066840709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 170033420054 + 170033420055.
It is an arithmetic number, because the mean of its divisors is an integer number (170033420055).
Almost surely, 2340066840109 is an apocalyptic number.
It is an amenable number.
340066840109 is a deficient number, since it is larger than the sum of its proper divisors (1).
340066840109 is an equidigital number, since it uses as much as digits as its factorization.
340066840109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 41.
The spelling of 340066840109 in words is "three hundred forty billion, sixty-six million, eight hundred forty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •