Base | Representation |
---|---|
bin | 1010001011011… |
… | …0011000001100 |
3 | 2222022212202100 |
4 | 2202312120030 |
5 | 41412040220 |
6 | 4122555100 |
7 | 1025600550 |
oct | 242663014 |
9 | 88285670 |
10 | 42690060 |
11 | 22108746 |
12 | 12368a90 |
13 | 8ac90ba |
14 | 5953860 |
15 | 3b33d90 |
hex | 28b660c |
42690060 has 144 divisors (see below), whose sum is σ = 156776256. Its totient is φ = 9179136.
The previous prime is 42690049. The next prime is 42690071. The reversal of 42690060 is 6009624.
It is an interprime number because it is at equal distance from previous prime (42690049) and next prime (42690071).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 20424 + ... + 22416.
It is an arithmetic number, because the mean of its divisors is an integer number (1088724).
Almost surely, 242690060 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 42690060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78388128).
42690060 is an abundant number, since it is smaller than the sum of its proper divisors (114086196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42690060 is a wasteful number, since it uses less digits than its factorization.
42690060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2032 (or 2027 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 42690060 is about 6533.7630811042. The cubic root of 42690060 is about 349.4960365985.
Adding to 42690060 its reverse (6009624), we get a palindrome (48699684).
The spelling of 42690060 in words is "forty-two million, six hundred ninety thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •