Base | Representation |
---|---|
bin | 1010000111001… |
… | …0111001010011 |
3 | 2221210211120222 |
4 | 2201302321103 |
5 | 41324214101 |
6 | 4113023255 |
7 | 1023336650 |
oct | 241627123 |
9 | 87724528 |
10 | 42413651 |
11 | 21a3a005 |
12 | 12254b2b |
13 | 8a30347 |
14 | 58c0c27 |
15 | 3acc01b |
hex | 2872e53 |
42413651 has 8 divisors (see below), whose sum is σ = 48728064. Its totient is φ = 36163080.
The previous prime is 42413647. The next prime is 42413669. The reversal of 42413651 is 15631424.
42413651 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 42413651 - 22 = 42413647 is a prime.
It is a super-2 number, since 2×424136512 = 3597835582299602, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42413651.
It is not an unprimeable number, because it can be changed into a prime (42413251) 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, 14525 + ... + 17198.
It is an arithmetic number, because the mean of its divisors is an integer number (6091008).
Almost surely, 242413651 is an apocalyptic number.
42413651 is a deficient number, since it is larger than the sum of its proper divisors (6314413).
42413651 is a wasteful number, since it uses less digits than its factorization.
42413651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31921.
The product of its digits is 2880, while the sum is 26.
The square root of 42413651 is about 6512.5763719130. The cubic root of 42413651 is about 348.7400987241.
The spelling of 42413651 in words is "forty-two million, four hundred thirteen thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •