Base | Representation |
---|---|
bin | 100111010111110010… |
… | …010110000110000000 |
3 | 11001010012212202101112 |
4 | 213113302112012000 |
5 | 1143034400123200 |
6 | 31230524022452 |
7 | 3024420416600 |
oct | 472762260600 |
9 | 131105782345 |
10 | 42275004800 |
11 | 16a241578a6 |
12 | 8239991a28 |
13 | 3ca94b5752 |
14 | 20907b0c00 |
15 | 11765bc535 |
hex | 9d7c96180 |
42275004800 has 288 divisors, whose sum is σ = 123799129920. Its totient is φ = 14218014720.
The previous prime is 42275004799. The next prime is 42275004809. The reversal of 42275004800 is 840057224.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42275004809) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 8307857 + ... + 8312943.
It is an arithmetic number, because the mean of its divisors is an integer number (429858090).
Almost surely, 242275004800 is an apocalyptic number.
42275004800 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 42275004800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61899564960).
42275004800 is an abundant number, since it is smaller than the sum of its proper divisors (81524125120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42275004800 is a wasteful number, since it uses less digits than its factorization.
42275004800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5178 (or 5154 counting only the distinct ones).
The product of its (nonzero) digits is 17920, while the sum is 32.
The spelling of 42275004800 in words is "forty-two billion, two hundred seventy-five million, four thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •