Base | Representation |
---|---|
bin | 11001010001101… |
… | …010111000000101 |
3 | 1002112221121100101 |
4 | 121101222320011 |
5 | 1332024444334 |
6 | 110025044101 |
7 | 13336320505 |
oct | 3121527005 |
9 | 1075847311 |
10 | 424062469 |
11 | 1a8410456 |
12 | ba026631 |
13 | 69b17b4c |
14 | 40469a05 |
15 | 27368214 |
hex | 1946ae05 |
424062469 has 2 divisors, whose sum is σ = 424062470. Its totient is φ = 424062468.
The previous prime is 424062437. The next prime is 424062473. The reversal of 424062469 is 964260424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 299739969 + 124322500 = 17313^2 + 11150^2 .
It is a cyclic number.
It is not a de Polignac number, because 424062469 - 25 = 424062437 is a prime.
It is a super-2 number, since 2×4240624692 = 359657955228751922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (424062479) 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 as a sum of consecutive naturals, namely, 212031234 + 212031235.
It is an arithmetic number, because the mean of its divisors is an integer number (212031235).
Almost surely, 2424062469 is an apocalyptic number.
It is an amenable number.
424062469 is a deficient number, since it is larger than the sum of its proper divisors (1).
424062469 is an equidigital number, since it uses as much as digits as its factorization.
424062469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 37.
The square root of 424062469 is about 20592.7771075200. Note that the first 3 decimals coincide. The cubic root of 424062469 is about 751.2940439090.
The spelling of 424062469 in words is "four hundred twenty-four million, sixty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.009 sec. • engine limits •