Base | Representation |
---|---|
bin | 111100011010100001100110… |
… | …0010011101011101000100111 |
3 | 2120200120102001010121102220012 |
4 | 1320311003030103223220213 |
5 | 1024123120004133423030 |
6 | 5122114524052400435 |
7 | 216635121321650360 |
oct | 17065031423535047 |
9 | 2520512033542805 |
10 | 531411141311015 |
11 | 144362221456a69 |
12 | 4b72705801611b |
13 | 19a69b179b0414 |
14 | 9532617988b67 |
15 | 41683539db095 |
hex | 1e350cc4eba27 |
531411141311015 has 32 divisors (see below), whose sum is σ = 742771635780096. Its totient is φ = 357410834352000.
The previous prime is 531411141310997. The next prime is 531411141311021. The reversal of 531411141311015 is 510113141114135.
It is not a de Polignac number, because 531411141311015 - 218 = 531411141048871 is a prime.
It is a super-2 number, since 2×5314111413110152 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38028917 + ... + 50090126.
It is an arithmetic number, because the mean of its divisors is an integer number (23211613618128).
Almost surely, 2531411141311015 is an apocalyptic number.
531411141311015 is a deficient number, since it is larger than the sum of its proper divisors (211360494469081).
531411141311015 is a wasteful number, since it uses less digits than its factorization.
531411141311015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88122359.
The product of its (nonzero) digits is 3600, while the sum is 32.
The spelling of 531411141311015 in words is "five hundred thirty-one trillion, four hundred eleven billion, one hundred forty-one million, three hundred eleven thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •