Base | Representation |
---|---|
bin | 1010001010111… |
… | …1001001010000 |
3 | 2222021101010000 |
4 | 2202233021100 |
5 | 41410113212 |
6 | 4122210000 |
7 | 1025415303 |
oct | 242571120 |
9 | 88241100 |
10 | 42660432 |
11 | 22098461 |
12 | 12353900 |
13 | 8ab8779 |
14 | 5946b3a |
15 | 3b2a1dc |
hex | 28af250 |
42660432 has 50 divisors (see below), whose sum is σ = 123475418. Its totient is φ = 14219712.
The previous prime is 42660407. The next prime is 42660451. The reversal of 42660432 is 23406624.
42660432 is a `hidden beast` number, since 4 + 26 + 604 + 32 = 666.
It can be written as a sum of positive squares in only one way, i.e., 37015056 + 5645376 = 6084^2 + 2376^2 .
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 42660396 and 42660405.
It is a congruent number.
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 9 ways as a sum of consecutive naturals, for example, 15163 + ... + 17754.
Almost surely, 242660432 is an apocalyptic number.
It is an amenable number.
42660432 is an abundant number, since it is smaller than the sum of its proper divisors (80814986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42660432 is a wasteful number, since it uses less digits than its factorization.
42660432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32937 (or 32922 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The square root of 42660432 is about 6531.4953877347. The cubic root of 42660432 is about 349.4151648060.
The spelling of 42660432 in words is "forty-two million, six hundred sixty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •