Base | Representation |
---|---|
bin | 11001001100000… |
… | …110101010000001 |
3 | 1002110012110212112 |
4 | 121030012222001 |
5 | 1331141302033 |
6 | 105533505105 |
7 | 13321032602 |
oct | 3114065201 |
9 | 1073173775 |
10 | 422603393 |
11 | 1a7604203 |
12 | b9642195 |
13 | 697269a4 |
14 | 401a9da9 |
15 | 2717ac48 |
hex | 19306a81 |
422603393 has 2 divisors, whose sum is σ = 422603394. Its totient is φ = 422603392.
The previous prime is 422603317. The next prime is 422603407. The reversal of 422603393 is 393306224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 397723249 + 24880144 = 19943^2 + 4988^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-422603393 is a prime.
It is a super-2 number, since 2×4226033932 = 357187255550224898, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (422203393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 211301696 + 211301697.
It is an arithmetic number, because the mean of its divisors is an integer number (211301697).
Almost surely, 2422603393 is an apocalyptic number.
It is an amenable number.
422603393 is a deficient number, since it is larger than the sum of its proper divisors (1).
422603393 is an equidigital number, since it uses as much as digits as its factorization.
422603393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 32.
The square root of 422603393 is about 20557.3196939679. The cubic root of 422603393 is about 750.4313921165.
The spelling of 422603393 in words is "four hundred twenty-two million, six hundred three thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •