Base | Representation |
---|---|
bin | 110001111110010010010… |
… | …101101111011011110101 |
3 | 110011022002201001122210221 |
4 | 301332102111233123311 |
5 | 422231101303323412 |
6 | 11145341442414341 |
7 | 503052020505424 |
oct | 61762225573365 |
9 | 13138081048727 |
10 | 3434134042357 |
11 | 1104454159337 |
12 | 4756846613b1 |
13 | 1bbab6b57435 |
14 | bc2da58b2bb |
15 | 5e4e2b67b07 |
hex | 31f9256f6f5 |
3434134042357 has 2 divisors, whose sum is σ = 3434134042358. Its totient is φ = 3434134042356.
The previous prime is 3434134042309. The next prime is 3434134042369. The reversal of 3434134042357 is 7532404314343.
3434134042357 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3155646699396 + 278487342961 = 1776414^2 + 527719^2 .
It is an emirp because it is prime and its reverse (7532404314343) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3434134042357 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3434134042307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1717067021178 + 1717067021179.
It is an arithmetic number, because the mean of its divisors is an integer number (1717067021179).
Almost surely, 23434134042357 is an apocalyptic number.
It is an amenable number.
3434134042357 is a deficient number, since it is larger than the sum of its proper divisors (1).
3434134042357 is an equidigital number, since it uses as much as digits as its factorization.
3434134042357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1451520, while the sum is 43.
The spelling of 3434134042357 in words is "three trillion, four hundred thirty-four billion, one hundred thirty-four million, forty-two thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •