Base | Representation |
---|---|
bin | 100110100101001100000… |
… | …0010111100110101000000 |
3 | 200202220210011112122102201 |
4 | 1031022120002330311000 |
5 | 1143334100340203121 |
6 | 15135541542322544 |
7 | 1055044620015232 |
oct | 115123002746500 |
9 | 20686704478381 |
10 | 5302540553536 |
11 | 17648819a6286 |
12 | 717802129454 |
13 | 2c6048350a95 |
14 | 144904094252 |
15 | 92de7e6be91 |
hex | 4d2980bcd40 |
5302540553536 has 224 divisors, whose sum is σ = 11786926896000. Its totient is φ = 2355053395968.
The previous prime is 5302540553491. The next prime is 5302540553537. The reversal of 5302540553536 is 6353550452035.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5302540553537) 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 31 ways as a sum of consecutive naturals, for example, 333212716 + ... + 333228628.
Almost surely, 25302540553536 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 5302540553536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5893463448000).
5302540553536 is an abundant number, since it is smaller than the sum of its proper divisors (6484386342464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5302540553536 is a wasteful number, since it uses less digits than its factorization.
5302540553536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16209 (or 16199 counting only the distinct ones).
The product of its (nonzero) digits is 4050000, while the sum is 46.
The spelling of 5302540553536 in words is "five trillion, three hundred two billion, five hundred forty million, five hundred fifty-three thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •