Base | Representation |
---|---|
bin | 100110111001011010000011… |
… | …0111101001000011001000101 |
3 | 1122212102102000212002011210112 |
4 | 1031302310012331020121011 |
5 | 324321121301123030414 |
6 | 3211401345504002405 |
7 | 132031623324212444 |
oct | 11562640675103105 |
9 | 1585372025064715 |
10 | 342141506455109 |
11 | 9a020441868539 |
12 | 32459396300405 |
13 | 118baa61c3808a |
14 | 606ba470d2d5b |
15 | 2984d4464bd3e |
hex | 1372d06f48645 |
342141506455109 has 2 divisors, whose sum is σ = 342141506455110. Its totient is φ = 342141506455108.
The previous prime is 342141506455037. The next prime is 342141506455207. The reversal of 342141506455109 is 901554605141243.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 255516324674884 + 86625181780225 = 15984878^2 + 9307265^2 .
It is a cyclic number.
It is not a de Polignac number, because 342141506455109 - 224 = 342141489677893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (342141506458109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 171070753227554 + 171070753227555.
It is an arithmetic number, because the mean of its divisors is an integer number (171070753227555).
Almost surely, 2342141506455109 is an apocalyptic number.
It is an amenable number.
342141506455109 is a deficient number, since it is larger than the sum of its proper divisors (1).
342141506455109 is an equidigital number, since it uses as much as digits as its factorization.
342141506455109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592000, while the sum is 50.
The spelling of 342141506455109 in words is "three hundred forty-two trillion, one hundred forty-one billion, five hundred six million, four hundred fifty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •