Base | Representation |
---|---|
bin | 1010000000111… |
… | …0011011000011 |
3 | 2221000221001220 |
4 | 2200032123003 |
5 | 41223031430 |
6 | 4100130123 |
7 | 1020004101 |
oct | 240163303 |
9 | 87027056 |
10 | 42002115 |
11 | 217888a1 |
12 | 12096943 |
13 | 8917c2c |
14 | 5814c71 |
15 | 3a4a110 |
hex | 280e6c3 |
42002115 has 8 divisors (see below), whose sum is σ = 67203408. Its totient is φ = 22401120.
The previous prime is 42002113. The next prime is 42002119. The reversal of 42002115 is 51120024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42002115 - 21 = 42002113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 2800141 = 42002115 / (4 + 2 + 0 + 0 + 2 + 1 + 1 + 5).
It is a junction number, because it is equal to n+sod(n) for n = 42002094 and 42002103.
It is not an unprimeable number, because it can be changed into a prime (42002113) 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 7 ways as a sum of consecutive naturals, for example, 1400056 + ... + 1400085.
It is an arithmetic number, because the mean of its divisors is an integer number (8400426).
Almost surely, 242002115 is an apocalyptic number.
42002115 is a deficient number, since it is larger than the sum of its proper divisors (25201293).
42002115 is a wasteful number, since it uses less digits than its factorization.
42002115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2800149.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 42002115 is about 6480.9038721462. The cubic root of 42002115 is about 347.6084991497.
Adding to 42002115 its reverse (51120024), we get a palindrome (93122139).
The spelling of 42002115 in words is "forty-two million, two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •