Base | Representation |
---|---|
bin | 1110101110100111001… |
… | …00101110100000000101 |
3 | 1210101020020122221102020 |
4 | 13113103210232200011 |
5 | 31242403030400421 |
6 | 1024251531033353 |
7 | 51363441526320 |
oct | 7272344564005 |
9 | 1711206587366 |
10 | 506060793861 |
11 | 18568a141647 |
12 | 820b289b859 |
13 | 3894b9b0c2c |
14 | 1a6ca1397b7 |
15 | d26cc78dc6 |
hex | 75d392e805 |
506060793861 has 64 divisors (see below), whose sum is σ = 798817560576. Its totient is φ = 278942227200.
The previous prime is 506060793857. The next prime is 506060793863. The reversal of 506060793861 is 168397060605.
It is not a de Polignac number, because 506060793861 - 22 = 506060793857 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506060793863) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 53315326 + ... + 53324816.
It is an arithmetic number, because the mean of its divisors is an integer number (12481524384).
Almost surely, 2506060793861 is an apocalyptic number.
It is an amenable number.
506060793861 is a deficient number, since it is larger than the sum of its proper divisors (292756766715).
506060793861 is a wasteful number, since it uses less digits than its factorization.
506060793861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10122.
The product of its (nonzero) digits is 1632960, while the sum is 51.
It can be divided in two parts, 506060 and 793861, that added together give a palindrome (1299921).
The spelling of 506060793861 in words is "five hundred six billion, sixty million, seven hundred ninety-three thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •