Base | Representation |
---|---|
bin | 11001001011011… |
… | …100011000000101 |
3 | 1002102212200022110 |
4 | 121023130120011 |
5 | 1331120231323 |
6 | 105530051233 |
7 | 13316411652 |
oct | 3113343005 |
9 | 1072780273 |
10 | 422430213 |
11 | 1a74a6087 |
12 | b9579b19 |
13 | 69695c0a |
14 | 40162c29 |
15 | 27144793 |
hex | 192dc605 |
422430213 has 8 divisors (see below), whose sum is σ = 587729088. Its totient is φ = 269375744.
The previous prime is 422430209. The next prime is 422430227. The reversal of 422430213 is 312034224.
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 422430213 - 22 = 422430209 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 422430213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422430413) 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, 3061020 + ... + 3061157.
It is an arithmetic number, because the mean of its divisors is an integer number (73466136).
Almost surely, 2422430213 is an apocalyptic number.
It is an amenable number.
422430213 is a deficient number, since it is larger than the sum of its proper divisors (165298875).
422430213 is a wasteful number, since it uses less digits than its factorization.
422430213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6122203.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 422430213 is about 20553.1071373649. The cubic root of 422430213 is about 750.3288708820.
Adding to 422430213 its reverse (312034224), we get a palindrome (734464437).
The spelling of 422430213 in words is "four hundred twenty-two million, four hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •