Base | Representation |
---|---|
bin | 1000010011000111111… |
… | …1101110000100000000 |
3 | 111122000010200222210020 |
4 | 2010301333232010000 |
5 | 4313442103124341 |
6 | 145255203533440 |
7 | 13205041011000 |
oct | 2046177560400 |
9 | 448003628706 |
10 | 142572708096 |
11 | 55512638885 |
12 | 2376b38a280 |
13 | 105a189a790 |
14 | 6c871a8000 |
15 | 3a96a10566 |
hex | 2131fee100 |
142572708096 has 1152 divisors, whose sum is σ = 527450112000. Its totient is φ = 33814609920.
The previous prime is 142572708059. The next prime is 142572708119. The reversal of 142572708096 is 690807275241.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1804717785 + ... + 1804717863.
It is an arithmetic number, because the mean of its divisors is an integer number (457856000).
Almost surely, 2142572708096 is an apocalyptic number.
142572708096 is a gapful number since it is divisible by the number (16) 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 142572708096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (263725056000).
142572708096 is an abundant number, since it is smaller than the sum of its proper divisors (384877403904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142572708096 is a wasteful number, since it uses less digits than its factorization.
142572708096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180 (or 152 counting only the distinct ones).
The product of its (nonzero) digits is 1693440, while the sum is 51.
The spelling of 142572708096 in words is "one hundred forty-two billion, five hundred seventy-two million, seven hundred eight thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •