Base | Representation |
---|---|
bin | 1010000101001… |
… | …1011101010101 |
3 | 2221120021221212 |
4 | 2201103131111 |
5 | 41311104020 |
6 | 4110151205 |
7 | 1022262356 |
oct | 241233525 |
9 | 87507855 |
10 | 42284885 |
11 | 21961295 |
12 | 121b2505 |
13 | 89b6856 |
14 | 5889d2d |
15 | 3aa3cc5 |
hex | 2853755 |
42284885 has 8 divisors (see below), whose sum is σ = 51437400. Its totient is φ = 33364224.
The previous prime is 42284863. The next prime is 42284897. The reversal of 42284885 is 58848224.
42284885 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 10666756 + 31618129 = 3266^2 + 5623^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 42284885 - 28 = 42284629 is a prime.
It is a super-2 number, since 2×422848852 = 3576022998926450, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 57560 + ... + 58289.
It is an arithmetic number, because the mean of its divisors is an integer number (6429675).
Almost surely, 242284885 is an apocalyptic number.
It is an amenable number.
42284885 is a deficient number, since it is larger than the sum of its proper divisors (9152515).
42284885 is a wasteful number, since it uses less digits than its factorization.
42284885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115927.
The product of its digits is 163840, while the sum is 41.
The square root of 42284885 is about 6502.6829078466. The cubic root of 42284885 is about 348.3868210460.
The spelling of 42284885 in words is "forty-two million, two hundred eighty-four thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •