Base | Representation |
---|---|
bin | 1010000111001… |
… | …1001110010101 |
3 | 2221210220102211 |
4 | 2201303032111 |
5 | 41324234442 |
6 | 4113033421 |
7 | 1023343612 |
oct | 241631625 |
9 | 87726384 |
10 | 42414997 |
11 | 21a40019 |
12 | 12255871 |
13 | 8a30b41 |
14 | 58c1509 |
15 | 3acc617 |
hex | 2873395 |
42414997 has 8 divisors (see below), whose sum is σ = 43144920. Its totient is φ = 41690880.
The previous prime is 42414991. The next prime is 42415001. The reversal of 42414997 is 79941424.
42414997 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 3651921 + 38763076 = 1911^2 + 6226^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 42414997 - 23 = 42414989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42414991) by changing a digit.
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, 14793 + ... + 17425.
It is an arithmetic number, because the mean of its divisors is an integer number (5393115).
Almost surely, 242414997 is an apocalyptic number.
It is an amenable number.
42414997 is a deficient number, since it is larger than the sum of its proper divisors (729923).
42414997 is a wasteful number, since it uses less digits than its factorization.
42414997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2903.
The product of its digits is 72576, while the sum is 40.
The square root of 42414997 is about 6512.6797096126. The cubic root of 42414997 is about 348.7437877818.
The spelling of 42414997 in words is "forty-two million, four hundred fourteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •