Base | Representation |
---|---|
bin | 11001010110011… |
… | …110011101100101 |
3 | 1002122022121120022 |
4 | 121112132131211 |
5 | 1332340303331 |
6 | 110112044525 |
7 | 13353115553 |
oct | 3126363545 |
9 | 1078277508 |
10 | 425322341 |
11 | 1a90a0a74 |
12 | ba533745 |
13 | 6a169432 |
14 | 406b6bd3 |
15 | 2751667b |
hex | 1959e765 |
425322341 has 2 divisors, whose sum is σ = 425322342. Its totient is φ = 425322340.
The previous prime is 425322319. The next prime is 425322361. The reversal of 425322341 is 143223524.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 267191716 + 158130625 = 16346^2 + 12575^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-425322341 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 425322341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (425322311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212661170 + 212661171.
It is an arithmetic number, because the mean of its divisors is an integer number (212661171).
Almost surely, 2425322341 is an apocalyptic number.
It is an amenable number.
425322341 is a deficient number, since it is larger than the sum of its proper divisors (1).
425322341 is an equidigital number, since it uses as much as digits as its factorization.
425322341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 26.
The square root of 425322341 is about 20623.3445638674. The cubic root of 425322341 is about 752.0373294479.
Adding to 425322341 its reverse (143223524), we get a palindrome (568545865).
The spelling of 425322341 in words is "four hundred twenty-five million, three hundred twenty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •