Base | Representation |
---|---|
bin | 100111100000011101… |
… | …010100001111000000 |
3 | 11001111100122000121000 |
4 | 213200131110033000 |
5 | 1143334121041404 |
6 | 31253202132000 |
7 | 3031135122342 |
oct | 474035241700 |
9 | 131440560530 |
10 | 42420487104 |
11 | 16a99293906 |
12 | 827a651000 |
13 | 4000692258 |
14 | 20a5c41292 |
15 | 1184258339 |
hex | 9e07543c0 |
42420487104 has 224 divisors, whose sum is σ = 132244185600. Its totient is φ = 13296752640.
The previous prime is 42420487103. The next prime is 42420487139. The reversal of 42420487104 is 40178402424.
It is a super-2 number, since 2×424204871042 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42420487103) 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, 4493269 + ... + 4502699.
Almost surely, 242420487104 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 42420487104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66122092800).
42420487104 is an abundant number, since it is smaller than the sum of its proper divisors (89823698496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42420487104 is a wasteful number, since it uses less digits than its factorization.
42420487104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9608 (or 9592 counting only the distinct ones).
The product of its (nonzero) digits is 57344, while the sum is 36.
Adding to 42420487104 its reverse (40178402424), we get a palindrome (82598889528).
The spelling of 42420487104 in words is "forty-two billion, four hundred twenty million, four hundred eighty-seven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.964 sec. • engine limits •