Base | Representation |
---|---|
bin | 1010001001110… |
… | …0110000001110 |
3 | 2222010112210000 |
4 | 2202130300032 |
5 | 41400210402 |
6 | 4120425130 |
7 | 1024652550 |
oct | 242346016 |
9 | 88115700 |
10 | 42585102 |
11 | 220468aa |
12 | 123181a6 |
13 | 8a903b1 |
14 | 59274d0 |
15 | 3b12c1c |
hex | 289cc0e |
42585102 has 120 divisors (see below), whose sum is σ = 117977904. Its totient is φ = 11207808.
The previous prime is 42585083. The next prime is 42585107. The reversal of 42585102 is 20158524.
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 (42585107) 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 59 ways as a sum of consecutive naturals, for example, 906043 + ... + 906089.
Almost surely, 242585102 is an apocalyptic number.
42585102 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 42585102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58988952).
42585102 is an abundant number, since it is smaller than the sum of its proper divisors (75392802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42585102 is a wasteful number, since it uses less digits than its factorization.
42585102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132 (or 76 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 42585102 is about 6525.7261664891. The cubic root of 42585102 is about 349.2093772945.
The spelling of 42585102 in words is "forty-two million, five hundred eighty-five thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •