Base | Representation |
---|---|
bin | 1111100111011111101110… |
… | …11100101011110010111001 |
3 | 11111121002202221122220210212 |
4 | 13303233313130223302321 |
5 | 14000131231221221124 |
6 | 201012404311320505 |
7 | 10143105026153012 |
oct | 763576734536271 |
9 | 144532687586725 |
10 | 34342415023289 |
11 | aa40599a8077a |
12 | 3a27959380135 |
13 | 16216255648a9 |
14 | 86a278a4a009 |
15 | 3e84d1e6c40e |
hex | 1f3bf772bcb9 |
34342415023289 has 2 divisors, whose sum is σ = 34342415023290. Its totient is φ = 34342415023288.
The previous prime is 34342415023249. The next prime is 34342415023307. The reversal of 34342415023289 is 98232051424343.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32706274723600 + 1636140299689 = 5718940^2 + 1279117^2 .
It is an emirp because it is prime and its reverse (98232051424343) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 34342415023289 - 236 = 34273695546553 is a prime.
It is not a weakly prime, because it can be changed into another prime (34342415023249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17171207511644 + 17171207511645.
It is an arithmetic number, because the mean of its divisors is an integer number (17171207511645).
Almost surely, 234342415023289 is an apocalyptic number.
It is an amenable number.
34342415023289 is a deficient number, since it is larger than the sum of its proper divisors (1).
34342415023289 is an equidigital number, since it uses as much as digits as its factorization.
34342415023289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4976640, while the sum is 50.
The spelling of 34342415023289 in words is "thirty-four trillion, three hundred forty-two billion, four hundred fifteen million, twenty-three thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •