Base | Representation |
---|---|
bin | 100111000000111011010101… |
… | …1010100010110010111111101 |
3 | 1200000002012210201012000001212 |
4 | 1032001312223110112113331 |
5 | 324440040003333444112 |
6 | 3213512235553014205 |
7 | 132166402543551131 |
oct | 11601665324262775 |
9 | 1600065721160055 |
10 | 343175056156157 |
11 | 9a3897a6710395 |
12 | 325a575bb54365 |
13 | 11964365b17614 |
14 | 60a5a9319d3c1 |
15 | 29a1b86465522 |
hex | 1381dab5165fd |
343175056156157 has 2 divisors, whose sum is σ = 343175056156158. Its totient is φ = 343175056156156.
The previous prime is 343175056156139. The next prime is 343175056156217. The reversal of 343175056156157 is 751651650571343.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 193969295325796 + 149205760830361 = 13927286^2 + 12214981^2 .
It is a cyclic number.
It is not a de Polignac number, because 343175056156157 - 216 = 343175056090621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 343175056156096 and 343175056156105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (343175056153157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 171587528078078 + 171587528078079.
It is an arithmetic number, because the mean of its divisors is an integer number (171587528078079).
Almost surely, 2343175056156157 is an apocalyptic number.
It is an amenable number.
343175056156157 is a deficient number, since it is larger than the sum of its proper divisors (1).
343175056156157 is an equidigital number, since it uses as much as digits as its factorization.
343175056156157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39690000, while the sum is 59.
The spelling of 343175056156157 in words is "three hundred forty-three trillion, one hundred seventy-five billion, fifty-six million, one hundred fifty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •