Base | Representation |
---|---|
bin | 1010001000000… |
… | …1110011011001 |
3 | 2221220221100112 |
4 | 2202001303121 |
5 | 41333142323 |
6 | 4114214105 |
7 | 1024012661 |
oct | 242016331 |
9 | 87827315 |
10 | 42474713 |
11 | 21a80976 |
12 | 12284335 |
13 | 8a52088 |
14 | 58d91a1 |
15 | 3ae0178 |
hex | 2881cd9 |
42474713 has 2 divisors, whose sum is σ = 42474714. Its totient is φ = 42474712.
The previous prime is 42474673. The next prime is 42474737. The reversal of 42474713 is 31747424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35010889 + 7463824 = 5917^2 + 2732^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42474713 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is equal to p2574734 and since 42474713 and 2574734 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42474713.
It is not a weakly prime, because it can be changed into another prime (42471713) 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 as a sum of consecutive naturals, namely, 21237356 + 21237357.
It is an arithmetic number, because the mean of its divisors is an integer number (21237357).
Almost surely, 242474713 is an apocalyptic number.
It is an amenable number.
42474713 is a deficient number, since it is larger than the sum of its proper divisors (1).
42474713 is an equidigital number, since it uses as much as digits as its factorization.
42474713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18816, while the sum is 32.
The square root of 42474713 is about 6517.2626922658. The cubic root of 42474713 is about 348.9073762898.
The spelling of 42474713 in words is "forty-two million, four hundred seventy-four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •