Base | Representation |
---|---|
bin | 1010000010011… |
… | …1101111111100 |
3 | 2221020012101000 |
4 | 2200213233330 |
5 | 41234341402 |
6 | 4102250300 |
7 | 1020615405 |
oct | 240475774 |
9 | 87205330 |
10 | 42105852 |
11 | 21849828 |
12 | 12126990 |
13 | 8953209 |
14 | 58409ac |
15 | 3a6ac1c |
hex | 2827bfc |
42105852 has 96 divisors (see below), whose sum is σ = 115295040. Its totient is φ = 13271040.
The previous prime is 42105851. The next prime is 42105863. The reversal of 42105852 is 25850124.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42105851) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 163708 + ... + 163964.
It is an arithmetic number, because the mean of its divisors is an integer number (1200990).
Almost surely, 242105852 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 42105852, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57647520).
42105852 is an abundant number, since it is smaller than the sum of its proper divisors (73189188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42105852 is a wasteful number, since it uses less digits than its factorization.
42105852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348 (or 340 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 42105852 is about 6488.9022184034. The cubic root of 42105852 is about 347.8944388507.
Adding to 42105852 its reverse (25850124), we get a palindrome (67955976).
The spelling of 42105852 in words is "forty-two million, one hundred five thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •