Base | Representation |
---|---|
bin | 100110100101101001001… |
… | …1110001001000011110000 |
3 | 200210000022110222021222121 |
4 | 1031023102132021003300 |
5 | 1143343102303310143 |
6 | 15140223115444024 |
7 | 1055111121440200 |
oct | 115132236110360 |
9 | 20700273867877 |
10 | 5303520760048 |
11 | 176523522aa05 |
12 | 717a36456614 |
13 | 2c617344a834 |
14 | 14499832c400 |
15 | 92e5403d7ed |
hex | 4d2d27890f0 |
5303520760048 has 120 divisors (see below), whose sum is σ = 12091431610752. Its totient is φ = 2246736465792.
The previous prime is 5303520759941. The next prime is 5303520760063. The reversal of 5303520760048 is 8400670253035.
It is a junction number, because it is equal to n+sod(n) for n = 5303520759986 and 5303520760013.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 44111311 + ... + 44231377.
Almost surely, 25303520760048 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 5303520760048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6045715805376).
5303520760048 is an abundant number, since it is smaller than the sum of its proper divisors (6787910850704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5303520760048 is a wasteful number, since it uses less digits than its factorization.
5303520760048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120739 (or 120726 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 43.
The spelling of 5303520760048 in words is "five trillion, three hundred three billion, five hundred twenty million, seven hundred sixty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •