Base | Representation |
---|---|
bin | 11001000010110… |
… | …000101011010101 |
3 | 1002021121001000211 |
4 | 121002300223111 |
5 | 1330024412234 |
6 | 105405205421 |
7 | 13261151656 |
oct | 3102605325 |
9 | 1067531024 |
10 | 420154069 |
11 | 1a6190a75 |
12 | b8860871 |
13 | 69079b9a |
14 | 3db2d52d |
15 | 26d45164 |
hex | 190b0ad5 |
420154069 has 2 divisors, whose sum is σ = 420154070. Its totient is φ = 420154068.
The previous prime is 420154013. The next prime is 420154123. The reversal of 420154069 is 960451024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 319051044 + 101103025 = 17862^2 + 10055^2 .
It is a cyclic number.
It is not a de Polignac number, because 420154069 - 27 = 420153941 is a prime.
It is a super-2 number, since 2×4201540692 = 353058883394513522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 420154069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (420154769) 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, 210077034 + 210077035.
It is an arithmetic number, because the mean of its divisors is an integer number (210077035).
Almost surely, 2420154069 is an apocalyptic number.
It is an amenable number.
420154069 is a deficient number, since it is larger than the sum of its proper divisors (1).
420154069 is an equidigital number, since it uses as much as digits as its factorization.
420154069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 420154069 is about 20497.6600859708. The cubic root of 420154069 is about 748.9787992000.
The spelling of 420154069 in words is "four hundred twenty million, one hundred fifty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •