Base | Representation |
---|---|
bin | 1010000001110… |
… | …0111001111001 |
3 | 2221010221102212 |
4 | 2200130321321 |
5 | 41231431213 |
6 | 4101304505 |
7 | 1020342041 |
oct | 240347171 |
9 | 87127385 |
10 | 42061433 |
11 | 21819417 |
12 | 12105135 |
13 | 8938c2b |
14 | 582c721 |
15 | 3a5c9a8 |
hex | 281ce79 |
42061433 has 2 divisors, whose sum is σ = 42061434. Its totient is φ = 42061432.
The previous prime is 42061429. The next prime is 42061463. The reversal of 42061433 is 33416024.
It is a happy number.
42061433 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., 21603904 + 20457529 = 4648^2 + 4523^2 .
It is a cyclic number.
It is not a de Polignac number, because 42061433 - 22 = 42061429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42061399 and 42061408.
It is not a weakly prime, because it can be changed into another prime (42061423) 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, 21030716 + 21030717.
It is an arithmetic number, because the mean of its divisors is an integer number (21030717).
Almost surely, 242061433 is an apocalyptic number.
It is an amenable number.
42061433 is a deficient number, since it is larger than the sum of its proper divisors (1).
42061433 is an equidigital number, since it uses as much as digits as its factorization.
42061433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 42061433 is about 6485.4786253599. The cubic root of 42061433 is about 347.7720602932.
Adding to 42061433 its reverse (33416024), we get a palindrome (75477457).
The spelling of 42061433 in words is "forty-two million, sixty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •