Base | Representation |
---|---|
bin | 1001111101011001100… |
… | …01010001100010100101 |
3 | 1012201021120120200102211 |
4 | 10332230301101202211 |
5 | 21101311424430222 |
6 | 421112135203421 |
7 | 33503026426012 |
oct | 4765461214245 |
9 | 1181246520384 |
10 | 342201014437 |
11 | 122143608037 |
12 | 563a2516571 |
13 | 26366ba9479 |
14 | 127c3b72709 |
15 | 8d7c513277 |
hex | 4facc518a5 |
342201014437 has 2 divisors, whose sum is σ = 342201014438. Its totient is φ = 342201014436.
The previous prime is 342201014423. The next prime is 342201014447. The reversal of 342201014437 is 734410102243.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 323898712641 + 18302301796 = 569121^2 + 135286^2 .
It is an emirp because it is prime and its reverse (734410102243) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 342201014437 - 223 = 342192625829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 342201014399 and 342201014408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (342201014447) 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, 171100507218 + 171100507219.
It is an arithmetic number, because the mean of its divisors is an integer number (171100507219).
Almost surely, 2342201014437 is an apocalyptic number.
It is an amenable number.
342201014437 is a deficient number, since it is larger than the sum of its proper divisors (1).
342201014437 is an equidigital number, since it uses as much as digits as its factorization.
342201014437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 31.
The spelling of 342201014437 in words is "three hundred forty-two billion, two hundred one million, fourteen thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •