Base | Representation |
---|---|
bin | 100111001000010111… |
… | …111011111010110000 |
3 | 11000110012022110200001 |
4 | 213020113323322300 |
5 | 1142022201023400 |
6 | 31145125435344 |
7 | 3015130464544 |
oct | 471027737260 |
9 | 130405273601 |
10 | 42016423600 |
11 | 169011a2a28 |
12 | 818726bb54 |
13 | 3c67a5a218 |
14 | 20682dda24 |
15 | 115da40a6a |
hex | 9c85fbeb0 |
42016423600 has 120 divisors (see below), whose sum is σ = 102711372480. Its totient is φ = 16513685760.
The previous prime is 42016423567. The next prime is 42016423609. The reversal of 42016423600 is 632461024.
It is not an unprimeable number, because it can be changed into a prime (42016423609) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11870631 + ... + 11874169.
It is an arithmetic number, because the mean of its divisors is an integer number (855928104).
Almost surely, 242016423600 is an apocalyptic number.
42016423600 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42016423600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51355686240).
42016423600 is an abundant number, since it is smaller than the sum of its proper divisors (60694948880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42016423600 is a wasteful number, since it uses less digits than its factorization.
42016423600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4067 (or 4056 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 42016423600 its reverse (632461024), we get a palindrome (42648884624).
The spelling of 42016423600 in words is "forty-two billion, sixteen million, four hundred twenty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •