Base | Representation |
---|---|
bin | 100111101001011100… |
… | …001111011000000000 |
3 | 11001212212020000211010 |
4 | 213221130033120000 |
5 | 1144141211400000 |
6 | 31320144320520 |
7 | 3034645141500 |
oct | 475134173000 |
9 | 131785200733 |
10 | 42571200000 |
11 | 1706637271a |
12 | 8301013140 |
13 | 4025980794 |
14 | 20bbc73a00 |
15 | 11925c8d50 |
hex | 9e970f600 |
42571200000 has 720 divisors, whose sum is σ = 165811293648. Its totient is φ = 9676800000.
The previous prime is 42571199999. The next prime is 42571200013. The reversal of 42571200000 is 217524.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 42571200000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 235199910 + ... + 235200090.
Almost surely, 242571200000 is an apocalyptic number.
42571200000 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 42571200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82905646824).
42571200000 is an abundant number, since it is smaller than the sum of its proper divisors (123240093648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42571200000 is an frugal number, since it uses more digits than its factorization.
42571200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241 (or 198 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 21.
Adding to 42571200000 its reverse (217524), we get a palindrome (42571417524).
The spelling of 42571200000 in words is "forty-two billion, five hundred seventy-one million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •