Base | Representation |
---|---|
bin | 1010000001101… |
… | …0101101010001 |
3 | 2221010111002112 |
4 | 2200122231101 |
5 | 41231134213 |
6 | 4101155105 |
7 | 1020303563 |
oct | 240325521 |
9 | 87114075 |
10 | 42052433 |
11 | 21812685 |
12 | 120bba95 |
13 | 8934ac7 |
14 | 5829333 |
15 | 3a59ea8 |
hex | 281ab51 |
42052433 has 4 divisors (see below), whose sum is σ = 42075300. Its totient is φ = 42029568.
The previous prime is 42052403. The next prime is 42052447. The reversal of 42052433 is 33425024.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 37356544 + 4695889 = 6112^2 + 2167^2 .
It is a cyclic number.
It is not a de Polignac number, because 42052433 - 26 = 42052369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42052399 and 42052408.
It is not an unprimeable number, because it can be changed into a prime (42052403) 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 in 3 ways as a sum of consecutive naturals, for example, 8408 + ... + 12441.
It is an arithmetic number, because the mean of its divisors is an integer number (10518825).
Almost surely, 242052433 is an apocalyptic number.
It is an amenable number.
42052433 is a deficient number, since it is larger than the sum of its proper divisors (22867).
42052433 is a wasteful number, since it uses less digits than its factorization.
42052433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22866.
The product of its (nonzero) digits is 2880, while the sum is 23.
The square root of 42052433 is about 6484.7847304286. The cubic root of 42052433 is about 347.7472539438.
Adding to 42052433 its reverse (33425024), we get a palindrome (75477457).
The spelling of 42052433 in words is "forty-two million, fifty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •