Base | Representation |
---|---|
bin | 1001111101001101101… |
… | …00111011110000011101 |
3 | 1012201000121222012100011 |
4 | 10332212310323300131 |
5 | 21101110413413433 |
6 | 421054214203221 |
7 | 33500406105655 |
oct | 4764664736035 |
9 | 1181017865304 |
10 | 342101310493 |
11 | 1220a22a8a88 |
12 | 56375053511 |
13 | 2634c33a657 |
14 | 127b481b365 |
15 | 8d738bb3cd |
hex | 4fa6d3bc1d |
342101310493 has 2 divisors, whose sum is σ = 342101310494. Its totient is φ = 342101310492.
The previous prime is 342101310491. The next prime is 342101310581. The reversal of 342101310493 is 394013101243.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202970072484 + 139131238009 = 450522^2 + 373003^2 .
It is an emirp because it is prime and its reverse (394013101243) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 342101310493 - 21 = 342101310491 is a prime.
Together with 342101310491, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (342101310491) 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, 171050655246 + 171050655247.
It is an arithmetic number, because the mean of its divisors is an integer number (171050655247).
Almost surely, 2342101310493 is an apocalyptic number.
It is an amenable number.
342101310493 is a deficient number, since it is larger than the sum of its proper divisors (1).
342101310493 is an equidigital number, since it uses as much as digits as its factorization.
342101310493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 31.
The spelling of 342101310493 in words is "three hundred forty-two billion, one hundred one million, three hundred ten thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •