Base | Representation |
---|---|
bin | 110001010110100111001101… |
… | …0001001001111000111111101 |
3 | 2002221002010022201020111110012 |
4 | 1202231032122021033013331 |
5 | 423400030344310240314 |
6 | 4135142153515153005 |
7 | 160303606136254652 |
oct | 14255163211170775 |
9 | 2087063281214405 |
10 | 434116405555709 |
11 | 1163608085aa218 |
12 | 40832801a45765 |
13 | 15830003086676 |
14 | 792b4bbb35c29 |
15 | 352c56d50293e |
hex | 18ad39a24f1fd |
434116405555709 has 2 divisors, whose sum is σ = 434116405555710. Its totient is φ = 434116405555708.
The previous prime is 434116405555663. The next prime is 434116405555739. The reversal of 434116405555709 is 907555504611434.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 357999889183225 + 76116516372484 = 18920885^2 + 8724478^2 .
It is a cyclic number.
It is not a de Polignac number, because 434116405555709 - 248 = 152641428845053 is a prime.
It is a super-2 number, since 2×4341164055557092 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (434116405555739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217058202777854 + 217058202777855.
It is an arithmetic number, because the mean of its divisors is an integer number (217058202777855).
Almost surely, 2434116405555709 is an apocalyptic number.
It is an amenable number.
434116405555709 is a deficient number, since it is larger than the sum of its proper divisors (1).
434116405555709 is an equidigital number, since it uses as much as digits as its factorization.
434116405555709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360000, while the sum is 59.
The spelling of 434116405555709 in words is "four hundred thirty-four trillion, one hundred sixteen billion, four hundred five million, five hundred fifty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •