Base | Representation |
---|---|
bin | 11001001100000… |
… | …110010101001101 |
3 | 1002110012102001012 |
4 | 121030012111031 |
5 | 1331141231221 |
6 | 105533455005 |
7 | 13321025660 |
oct | 3114062515 |
9 | 1073172035 |
10 | 422602061 |
11 | 1a7603202 |
12 | b9641465 |
13 | 697261bb |
14 | 401a96d7 |
15 | 2717a65b |
hex | 1930654d |
422602061 has 8 divisors (see below), whose sum is σ = 483985920. Its totient is φ = 361471248.
The previous prime is 422602021. The next prime is 422602087. The reversal of 422602061 is 160206224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 422602061 - 210 = 422601037 is a prime.
It is a super-2 number, since 2×4226020612 = 357185003922895442, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422602001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59666 + ... + 66371.
It is an arithmetic number, because the mean of its divisors is an integer number (60498240).
Almost surely, 2422602061 is an apocalyptic number.
It is an amenable number.
422602061 is a deficient number, since it is larger than the sum of its proper divisors (61383859).
422602061 is a wasteful number, since it uses less digits than its factorization.
422602061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126523.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 422602061 is about 20557.2872967228. The cubic root of 422602061 is about 750.4306036896.
Adding to 422602061 its reverse (160206224), we get a palindrome (582808285).
The spelling of 422602061 in words is "four hundred twenty-two million, six hundred two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •