Base | Representation |
---|---|
bin | 100110101111011010000… |
… | …0000011100110010110000 |
3 | 200212000102110221110012020 |
4 | 1031132310000130302300 |
5 | 1144214021012342220 |
6 | 15154011233231440 |
7 | 1056452455321425 |
oct | 115366400346260 |
9 | 20760373843166 |
10 | 5324484496560 |
11 | 1773112764489 |
12 | 71bb07102580 |
13 | 2c81346a6758 |
14 | 1459c6601d4c |
15 | 9377e6c6040 |
hex | 4d7b401ccb0 |
5324484496560 has 80 divisors (see below), whose sum is σ = 16506974914560. Its totient is φ = 1419770233600.
The previous prime is 5324484496559. The next prime is 5324484496621. The reversal of 5324484496560 is 656944844235.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a junction number, because it is equal to n+sod(n) for n = 5324484496494 and 5324484496503.
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 15 ways as a sum of consecutive naturals, for example, 3018931 + ... + 4445549.
It is an arithmetic number, because the mean of its divisors is an integer number (206337186432).
Almost surely, 25324484496560 is an apocalyptic number.
It is an amenable number.
5324484496560 is an abundant number, since it is smaller than the sum of its proper divisors (11182490418000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5324484496560 is a wasteful number, since it uses less digits than its factorization.
5324484496560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1442186 (or 1442180 counting only the distinct ones).
The product of its (nonzero) digits is 99532800, while the sum is 60.
The spelling of 5324484496560 in words is "five trillion, three hundred twenty-four billion, four hundred eighty-four million, four hundred ninety-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •