Base | Representation |
---|---|
bin | 11001000010100… |
… | …000000100000001 |
3 | 1002021110120200101 |
4 | 121002200010001 |
5 | 1330020223032 |
6 | 105403522401 |
7 | 13260446401 |
oct | 3102400401 |
9 | 1067416611 |
10 | 420086017 |
11 | 1a614492a |
12 | b8829401 |
13 | 69054c10 |
14 | 3db12801 |
15 | 26d2ede7 |
hex | 190a0101 |
420086017 has 8 divisors (see below), whose sum is σ = 452609640. Its totient is φ = 387592320.
The previous prime is 420086011. The next prime is 420086021. The reversal of 420086017 is 710680024.
It is a Cunningham number, because it is equal to 204962+1.
It can be written as a sum of positive squares in 4 ways, for example, as 1 + 420086016 = 1^2 + 20496^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 420086017 - 27 = 420085889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420086011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27909 + ... + 40237.
It is an arithmetic number, because the mean of its divisors is an integer number (56576205).
Almost surely, 2420086017 is an apocalyptic number.
It is an amenable number.
420086017 is a deficient number, since it is larger than the sum of its proper divisors (32523623).
420086017 is a wasteful number, since it uses less digits than its factorization.
420086017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14963.
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 420086017 is about 20496.0000243950. Note that the first 4 decimals coincide. The cubic root of 420086017 is about 748.9383598620.
The spelling of 420086017 in words is "four hundred twenty million, eighty-six thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •