Base | Representation |
---|---|
bin | 11001000010101… |
… | …111101101100001 |
3 | 1002021120211121022 |
4 | 121002233231201 |
5 | 1330024300423 |
6 | 105405135225 |
7 | 13261134305 |
oct | 3102575541 |
9 | 1067524538 |
10 | 420150113 |
11 | 1a6188aa9 |
12 | b885a515 |
13 | 69078146 |
14 | 3db2bd05 |
15 | 26d43dc8 |
hex | 190afb61 |
420150113 has 8 divisors (see below), whose sum is σ = 426711528. Its totient is φ = 413610624.
The previous prime is 420150077. The next prime is 420150179. The reversal of 420150113 is 311051024.
It can be written as a sum of positive squares in 4 ways, for example, as 38651089 + 381499024 = 6217^2 + 19532^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 420150113 - 212 = 420146017 is a prime.
It is a super-2 number, since 2×4201501132 = 353052234907825538, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 420150091 and 420150100.
It is not an unprimeable number, because it can be changed into a prime (420150013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35495 + ... + 45827.
It is an arithmetic number, because the mean of its divisors is an integer number (53338941).
Almost surely, 2420150113 is an apocalyptic number.
It is an amenable number.
420150113 is a deficient number, since it is larger than the sum of its proper divisors (6561415).
420150113 is a wasteful number, since it uses less digits than its factorization.
420150113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10963.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 420150113 is about 20497.5635869242. The cubic root of 420150113 is about 748.9764484993.
The spelling of 420150113 in words is "four hundred twenty million, one hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •