Base | Representation |
---|---|
bin | 1010000011000… |
… | …1011110110011 |
3 | 2221022020001102 |
4 | 2200301132303 |
5 | 41242130330 |
6 | 4103155015 |
7 | 1021142543 |
oct | 240613663 |
9 | 87266042 |
10 | 42145715 |
11 | 21876777 |
12 | 12145a6b |
13 | 89683c1 |
14 | 5851323 |
15 | 3a77945 |
hex | 28317b3 |
42145715 has 4 divisors (see below), whose sum is σ = 50574864. Its totient is φ = 33716568.
The previous prime is 42145711. The next prime is 42145717. The reversal of 42145715 is 51754124.
42145715 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 42145715 - 22 = 42145711 is a prime.
It is a super-2 number, since 2×421457152 = 3552522585722450, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42145711) 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 3 ways as a sum of consecutive naturals, for example, 4214567 + ... + 4214576.
It is an arithmetic number, because the mean of its divisors is an integer number (12643716).
Almost surely, 242145715 is an apocalyptic number.
42145715 is a deficient number, since it is larger than the sum of its proper divisors (8429149).
42145715 is an equidigital number, since it uses as much as digits as its factorization.
42145715 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8429148.
The product of its digits is 5600, while the sum is 29.
The square root of 42145715 is about 6491.9731207084. The cubic root of 42145715 is about 348.0041919388.
Adding to 42145715 its reverse (51754124), we get a palindrome (93899839).
The spelling of 42145715 in words is "forty-two million, one hundred forty-five thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •