Base | Representation |
---|---|
bin | 1010001010001… |
… | …0111000011100 |
3 | 2222011211012201 |
4 | 2202202320130 |
5 | 41402011304 |
6 | 4121141244 |
7 | 1025116000 |
oct | 242427034 |
9 | 88154181 |
10 | 42610204 |
11 | 2206374a |
12 | 1232a824 |
13 | 8a9b950 |
14 | 5932700 |
15 | 3b1a3a4 |
hex | 28a2e1c |
42610204 has 48 divisors (see below), whose sum is σ = 93688000. Its totient is φ = 16849728.
The previous prime is 42610201. The next prime is 42610207. The reversal of 42610204 is 40201624.
It is an interprime number because it is at equal distance from previous prime (42610201) and next prime (42610207).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42610201) 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 15 ways as a sum of consecutive naturals, for example, 16642 + ... + 19030.
Almost surely, 242610204 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42610204, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46844000).
42610204 is an abundant number, since it is smaller than the sum of its proper divisors (51077796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42610204 is a wasteful number, since it uses less digits than its factorization.
42610204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2427 (or 2411 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 42610204 is about 6527.6491940054. The cubic root of 42610204 is about 349.2779782182.
Adding to 42610204 its reverse (40201624), we get a palindrome (82811828).
The spelling of 42610204 in words is "forty-two million, six hundred ten thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •