Base | Representation |
---|---|
bin | 110000011000111111011111… |
… | …0101101100011000110101101 |
3 | 2001211002111012012221011121011 |
4 | 1200301332332231203012231 |
5 | 421242301224421444142 |
6 | 4105135405024305221 |
7 | 155441001654043561 |
oct | 14061767655430655 |
9 | 2054074165834534 |
10 | 425647343546797 |
11 | 11369602a913169 |
12 | 3b8a5382172211 |
13 | 153674abb45558 |
14 | 77176270c76a1 |
15 | 34320e6ab6417 |
hex | 1831fbeb631ad |
425647343546797 has 2 divisors, whose sum is σ = 425647343546798. Its totient is φ = 425647343546796.
The previous prime is 425647343546699. The next prime is 425647343546813. The reversal of 425647343546797 is 797645343746524.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 425295796535401 + 351547011396 = 20622701^2 + 592914^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-425647343546797 is a prime.
It is a super-2 number, since 2×4256473435467972 (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 (425647343546297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212823671773398 + 212823671773399.
It is an arithmetic number, because the mean of its divisors is an integer number (212823671773399).
Almost surely, 2425647343546797 is an apocalyptic number.
It is an amenable number.
425647343546797 is a deficient number, since it is larger than the sum of its proper divisors (1).
425647343546797 is an equidigital number, since it uses as much as digits as its factorization.
425647343546797 is an evil number, because the sum of its binary digits is even.
The product of its digits is 12802406400, while the sum is 76.
The spelling of 425647343546797 in words is "four hundred twenty-five trillion, six hundred forty-seven billion, three hundred forty-three million, five hundred forty-six thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •