Base | Representation |
---|---|
bin | 1010000100001… |
… | …0011011001101 |
3 | 2221102202020212 |
4 | 2201002123031 |
5 | 41301340432 |
6 | 4104452205 |
7 | 1021552100 |
oct | 241023315 |
9 | 87382225 |
10 | 42215117 |
11 | 2191392a |
12 | 1217a065 |
13 | 8990b79 |
14 | 586c737 |
15 | 3a8d2b2 |
hex | 28426cd |
42215117 has 12 divisors (see below), whose sum is σ = 50307516. Its totient is φ = 35300160.
The previous prime is 42215101. The next prime is 42215123. The reversal of 42215117 is 71151224.
It can be written as a sum of positive squares in 2 ways, for example, as 561001 + 41654116 = 749^2 + 6454^2 .
It is not a de Polignac number, because 42215117 - 24 = 42215101 is a prime.
It is a super-2 number, since 2×422151172 = 3564232206647378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42215092 and 42215101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42215137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8498 + ... + 12515.
It is an arithmetic number, because the mean of its divisors is an integer number (4192293).
Almost surely, 242215117 is an apocalyptic number.
It is an amenable number.
42215117 is a deficient number, since it is larger than the sum of its proper divisors (8092399).
42215117 is a wasteful number, since it uses less digits than its factorization.
42215117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21068 (or 21061 counting only the distinct ones).
The product of its digits is 560, while the sum is 23.
The square root of 42215117 is about 6497.3161382220. The cubic root of 42215117 is about 348.1951084751.
The spelling of 42215117 in words is "forty-two million, two hundred fifteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •