Base | Representation |
---|---|
bin | 110001011011111101… |
… | …110100100001001100 |
3 | 12002000102011102201000 |
4 | 301123331310201030 |
5 | 1332203112240413 |
6 | 40215155020300 |
7 | 3556302101103 |
oct | 613375644114 |
9 | 162012142630 |
10 | 53082540108 |
11 | 2056a78a064 |
12 | a35529a690 |
13 | 500c593860 |
14 | 27d7ca103a |
15 | 15aa2e0073 |
hex | c5bf7484c |
53082540108 has 192 divisors, whose sum is σ = 150507302400. Its totient is φ = 16081079040.
The previous prime is 53082540089. The next prime is 53082540113. The reversal of 53082540108 is 80104528035.
It is a happy number.
53082540108 is a `hidden beast` number, since 5 + 3 + 0 + 8 + 2 + 540 + 108 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 45330363 + ... + 45331533.
It is an arithmetic number, because the mean of its divisors is an integer number (783892200).
Almost surely, 253082540108 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53082540108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75253651200).
53082540108 is an abundant number, since it is smaller than the sum of its proper divisors (97424762292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53082540108 is a wasteful number, since it uses less digits than its factorization.
53082540108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1669 (or 1661 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 36.
The spelling of 53082540108 in words is "fifty-three billion, eighty-two million, five hundred forty thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •