Base | Representation |
---|---|
bin | 10011010111000010100000… |
… | …10100000111000100101000 |
3 | 12120201221111222110010021201 |
4 | 21223201100110013010220 |
5 | 21040004113200141310 |
6 | 230313443440213544 |
7 | 11652542124111064 |
oct | 1153412024070450 |
9 | 176657458403251 |
10 | 42573063287080 |
11 | 12624153391337 |
12 | 4936b4090a2b4 |
13 | 1a9a812c36941 |
14 | a72793962aa4 |
15 | 4dc652d33e3a |
hex | 26b850507128 |
42573063287080 has 64 divisors (see below), whose sum is σ = 97624997671680. Its totient is φ = 16704416851200.
The previous prime is 42573063287011. The next prime is 42573063287081. The reversal of 42573063287080 is 8078236037524.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (42573063287081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22875606 + ... + 24666565.
It is an arithmetic number, because the mean of its divisors is an integer number (1525390588620).
Almost surely, 242573063287080 is an apocalyptic number.
42573063287080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42573063287080 is an abundant number, since it is smaller than the sum of its proper divisors (55051934384600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42573063287080 is a wasteful number, since it uses less digits than its factorization.
42573063287080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47542610 (or 47542606 counting only the distinct ones).
The product of its (nonzero) digits is 13547520, while the sum is 55.
The spelling of 42573063287080 in words is "forty-two trillion, five hundred seventy-three billion, sixty-three million, two hundred eighty-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •