Base | Representation |
---|---|
bin | 111100010001000100101000… |
… | …1011100111011101010100111 |
3 | 2120111222012201202001200002220 |
4 | 1320202021101130323222213 |
5 | 1023440323334000440030 |
6 | 5115242031342003423 |
7 | 216442220354101125 |
oct | 17042112134735247 |
9 | 2514865652050086 |
10 | 530112000015015 |
11 | 143a01267020900 |
12 | 4b557310276573 |
13 | 199a4468780c72 |
14 | 94c97b448a915 |
15 | 414466a186a10 |
hex | 1e2225173baa7 |
530112000015015 has 192 divisors, whose sum is σ = 945601706520576. Its totient is φ = 253379301120000.
The previous prime is 530112000015011. The next prime is 530112000015049. The reversal of 530112000015015 is 510510000211035.
It is not a de Polignac number, because 530112000015015 - 22 = 530112000015011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530112000015011) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 81293049955 + ... + 81293056475.
It is an arithmetic number, because the mean of its divisors is an integer number (4925008888128).
Almost surely, 2530112000015015 is an apocalyptic number.
530112000015015 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
530112000015015 is a deficient number, since it is larger than the sum of its proper divisors (415489706505561).
530112000015015 is a wasteful number, since it uses less digits than its factorization.
530112000015015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8502 (or 8491 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 530112000015015 in words is "five hundred thirty trillion, one hundred twelve billion, fifteen thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •