Base | Representation |
---|---|
bin | 1001000111000010011101000… |
… | …0110110010110100011011101 |
3 | 10010001210111022001020102110101 |
4 | 2101300213100312112203131 |
5 | 1133011041113011430112 |
6 | 10151225415442341101 |
7 | 252012604624563403 |
oct | 22160472066264335 |
9 | 3101714261212411 |
10 | 641057437608157 |
11 | 176295a29219059 |
12 | 5ba9528695a791 |
13 | 216915c2c940bb |
14 | b4434ba1d1473 |
15 | 4e1a595e51757 |
hex | 24709d0d968dd |
641057437608157 has 2 divisors, whose sum is σ = 641057437608158. Its totient is φ = 641057437608156.
The previous prime is 641057437608143. The next prime is 641057437608163. The reversal of 641057437608157 is 751806734750146.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 461879027459641 + 179178410148516 = 21491371^2 + 13385754^2 .
It is a cyclic number.
It is not a de Polignac number, because 641057437608157 - 227 = 641057303390429 is a prime.
It is a super-2 number, since 2×6410574376081572 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (641057437608197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320528718804078 + 320528718804079.
It is an arithmetic number, because the mean of its divisors is an integer number (320528718804079).
Almost surely, 2641057437608157 is an apocalyptic number.
It is an amenable number.
641057437608157 is a deficient number, since it is larger than the sum of its proper divisors (1).
641057437608157 is an equidigital number, since it uses as much as digits as its factorization.
641057437608157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 118540800, while the sum is 64.
The spelling of 641057437608157 in words is "six hundred forty-one trillion, fifty-seven billion, four hundred thirty-seven million, six hundred eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •