Base | Representation |
---|---|
bin | 11000100010111010100011… |
… | …01101100000111011111110 |
3 | 21002010002001220210110221010 |
4 | 30101131101231200323332 |
5 | 24033321302033112333 |
6 | 310444200240220050 |
7 | 14240440112364420 |
oct | 1421352155407376 |
9 | 232102056713833 |
10 | 53976224894718 |
11 | 16220208883215 |
12 | 6078b5460a626 |
13 | 2416c229b4979 |
14 | d4866b130810 |
15 | 6390a374e563 |
hex | 311751b60efe |
53976224894718 has 128 divisors (see below), whose sum is σ = 126166450176000. Its totient is φ = 15075728156160.
The previous prime is 53976224894681. The next prime is 53976224894731. The reversal of 53976224894718 is 81749842267935.
It is a self number, because there is not a number n which added to its sum of digits gives 53976224894718.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1461999063 + ... + 1462035981.
It is an arithmetic number, because the mean of its divisors is an integer number (985675392000).
Almost surely, 253976224894718 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53976224894718, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63083225088000).
53976224894718 is an abundant number, since it is smaller than the sum of its proper divisors (72190225281282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53976224894718 is a wasteful number, since it uses less digits than its factorization.
53976224894718 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40270.
The product of its digits is 1463132160, while the sum is 75.
The spelling of 53976224894718 in words is "fifty-three trillion, nine hundred seventy-six billion, two hundred twenty-four million, eight hundred ninety-four thousand, seven hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •