Base | Representation |
---|---|
bin | 1010001110111… |
… | …0100001101001 |
3 | 2222202120020011 |
4 | 2203232201221 |
5 | 41441420131 |
6 | 4131531521 |
7 | 1030546213 |
oct | 243564151 |
9 | 88676204 |
10 | 42920041 |
11 | 2225550a |
12 | 12459ba1 |
13 | 8b79998 |
14 | 59b35b3 |
15 | 3b7c0b1 |
hex | 28ee869 |
42920041 has 2 divisors, whose sum is σ = 42920042. Its totient is φ = 42920040.
The previous prime is 42920021. The next prime is 42920077. The reversal of 42920041 is 14002924.
42920041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23814400 + 19105641 = 4880^2 + 4371^2 .
It is a cyclic number.
It is not a de Polignac number, because 42920041 - 219 = 42395753 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 42919994 and 42920021.
It is not a weakly prime, because it can be changed into another prime (42920021) 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 as a sum of consecutive naturals, namely, 21460020 + 21460021.
It is an arithmetic number, because the mean of its divisors is an integer number (21460021).
Almost surely, 242920041 is an apocalyptic number.
It is an amenable number.
42920041 is a deficient number, since it is larger than the sum of its proper divisors (1).
42920041 is an equidigital number, since it uses as much as digits as its factorization.
42920041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 42920041 is about 6551.3388707958. The cubic root of 42920041 is about 350.1225176519.
Adding to 42920041 its reverse (14002924), we get a palindrome (56922965).
The spelling of 42920041 in words is "forty-two million, nine hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •