Base | Representation |
---|---|
bin | 100110101110000001100… |
… | …0001000111100100010100 |
3 | 200211201202112111201002201 |
4 | 1031130003001013210110 |
5 | 1144141430331321112 |
6 | 15152400441014244 |
7 | 1056316051026004 |
oct | 115340301074424 |
9 | 20751675451081 |
10 | 5321515104532 |
11 | 17719295aa290 |
12 | 71b418784384 |
13 | 2c7a8044ab53 |
14 | 1457c40c6004 |
15 | 93658b7b257 |
hex | 4d703047914 |
5321515104532 has 12 divisors (see below), whose sum is σ = 10159256108736. Its totient is φ = 2418870502040.
The previous prime is 5321515104527. The next prime is 5321515104533. The reversal of 5321515104532 is 2354015151235.
It is a junction number, because it is equal to n+sod(n) for n = 5321515104491 and 5321515104500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5321515104533) 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 3 ways as a sum of consecutive naturals, for example, 60471762508 + ... + 60471762595.
It is an arithmetic number, because the mean of its divisors is an integer number (846604675728).
Almost surely, 25321515104532 is an apocalyptic number.
It is an amenable number.
5321515104532 is a deficient number, since it is larger than the sum of its proper divisors (4837741004204).
5321515104532 is a wasteful number, since it uses less digits than its factorization.
5321515104532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120943525118 (or 120943525116 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 37.
The spelling of 5321515104532 in words is "five trillion, three hundred twenty-one billion, five hundred fifteen million, one hundred four thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •