Base | Representation |
---|---|
bin | 100110101000111001010… |
… | …1010011101100001010000 |
3 | 200210200100002212122210010 |
4 | 1031101302222131201100 |
5 | 1144001402321431230 |
6 | 15143340032034520 |
7 | 1055446136234655 |
oct | 115216252354120 |
9 | 20720302778703 |
10 | 5310503311440 |
11 | 1768198747138 |
12 | 719264992a40 |
13 | 2c6a16c54752 |
14 | 14505b825c2c |
15 | 9321205c9b0 |
hex | 4d472a9d850 |
5310503311440 has 160 divisors (see below), whose sum is σ = 16492645403136. Its totient is φ = 1413548236800.
The previous prime is 5310503311363. The next prime is 5310503311489. The reversal of 5310503311440 is 441133050135.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 5310503311398 and 5310503311407.
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 31 ways as a sum of consecutive naturals, for example, 427123464 + ... + 427135896.
Almost surely, 25310503311440 is an apocalyptic number.
It is an amenable number.
5310503311440 is an abundant number, since it is smaller than the sum of its proper divisors (11182142091696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5310503311440 is a wasteful number, since it uses less digits than its factorization.
5310503311440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15557 (or 15551 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 5310503311440 its reverse (441133050135), we get a palindrome (5751636361575).
The spelling of 5310503311440 in words is "five trillion, three hundred ten billion, five hundred three million, three hundred eleven thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •