Base | Representation |
---|---|
bin | 111001100010100111100101… |
… | …1110011100010001001000001 |
3 | 2110101002001112211111200102121 |
4 | 1303011033023303202021001 |
5 | 1012320004443042042221 |
6 | 4552243154001044241 |
7 | 211416031222435213 |
oct | 16305171363421101 |
9 | 2411061484450377 |
10 | 506135250346561 |
11 | 1372a78329a1440 |
12 | 4892449b326681 |
13 | 1895547058b244 |
14 | 8cdb110b425b3 |
15 | 3d7ab15602a41 |
hex | 1cc53cbce2241 |
506135250346561 has 16 divisors (see below), whose sum is σ = 555200393844096. Its totient is φ = 457578936000000.
The previous prime is 506135250346507. The next prime is 506135250346637. The reversal of 506135250346561 is 165643052531605.
It is a cyclic number.
It is not a de Polignac number, because 506135250346561 - 229 = 506134713475649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 506135250346499 and 506135250346508.
It is not an unprimeable number, because it can be changed into a prime (506135250346501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 735830481 + ... + 736518001.
It is an arithmetic number, because the mean of its divisors is an integer number (34700024615256).
Almost surely, 2506135250346561 is an apocalyptic number.
It is an amenable number.
506135250346561 is a deficient number, since it is larger than the sum of its proper divisors (49065143497535).
506135250346561 is a wasteful number, since it uses less digits than its factorization.
506135250346561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1057464.
The product of its (nonzero) digits is 9720000, while the sum is 52.
The spelling of 506135250346561 in words is "five hundred six trillion, one hundred thirty-five billion, two hundred fifty million, three hundred forty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •