Base | Representation |
---|---|
bin | 100111011100111110… |
… | …001010001000011000 |
3 | 11001100021112221101000 |
4 | 213130332022020120 |
5 | 1143224132100413 |
6 | 31243312225000 |
7 | 3026524645023 |
oct | 473476121030 |
9 | 131307487330 |
10 | 42361987608 |
11 | 16a69268316 |
12 | 8262b3b160 |
13 | 3cc151c275 |
14 | 209c1741ba |
15 | 117e050073 |
hex | 9dcf8a218 |
42361987608 has 192 divisors, whose sum is σ = 128386663200. Its totient is φ = 12930140160.
The previous prime is 42361987607. The next prime is 42361987631. The reversal of 42361987608 is 80678916324.
42361987608 is a `hidden beast` number, since 4 + 23 + 6 + 1 + 9 + 8 + 7 + 608 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42361987607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2300518 + ... + 2318858.
Almost surely, 242361987608 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 42361987608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64193331600).
42361987608 is an abundant number, since it is smaller than the sum of its proper divisors (86024675592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42361987608 is a wasteful number, since it uses less digits than its factorization.
42361987608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18427 (or 18400 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The spelling of 42361987608 in words is "forty-two billion, three hundred sixty-one million, nine hundred eighty-seven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •