Base | Representation |
---|---|
bin | 11001001011011… |
… | …010011011111001 |
3 | 1002102212021102002 |
4 | 121023122123321 |
5 | 1331120003030 |
6 | 105525550345 |
7 | 13316346536 |
oct | 3113323371 |
9 | 1072767362 |
10 | 422422265 |
11 | 1a74a0111 |
12 | b95753b5 |
13 | 69692405 |
14 | 4015dd8d |
15 | 27142245 |
hex | 192da6f9 |
422422265 has 8 divisors (see below), whose sum is σ = 524386440. Its totient is φ = 326284672.
The previous prime is 422422183. The next prime is 422422283. The reversal of 422422265 is 562224224.
It can be written as a sum of positive squares in 4 ways, for example, as 8543929 + 413878336 = 2923^2 + 20344^2 .
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 422422265 - 212 = 422418169 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Curzon number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 1456484 + ... + 1456773.
It is an arithmetic number, because the mean of its divisors is an integer number (65548305).
Almost surely, 2422422265 is an apocalyptic number.
It is an amenable number.
422422265 is a deficient number, since it is larger than the sum of its proper divisors (101964175).
422422265 is a wasteful number, since it uses less digits than its factorization.
422422265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2913291.
The product of its digits is 15360, while the sum is 29.
The square root of 422422265 is about 20552.9137836950. The cubic root of 422422265 is about 750.3241650544.
Adding to 422422265 its reverse (562224224), we get a palindrome (984646489).
The spelling of 422422265 in words is "four hundred twenty-two million, four hundred twenty-two thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •