Base | Representation |
---|---|
bin | 1110101110001010000… |
… | …10101011000011101001 |
3 | 1210100121020220012200021 |
4 | 13113011002223003221 |
5 | 31241403122021313 |
6 | 1024211421240441 |
7 | 51354421303615 |
oct | 7270502530351 |
9 | 1710536805607 |
10 | 505816985833 |
11 | 185574558005 |
12 | 82045103121 |
13 | 38910328a23 |
14 | 1a6a59d2345 |
15 | d25666978d |
hex | 75c50ab0e9 |
505816985833 has 4 divisors (see below), whose sum is σ = 505823170048. Its totient is φ = 505810801620.
The previous prime is 505816985777. The next prime is 505816985851. The reversal of 505816985833 is 338589618505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 338589618505 = 5 ⋅67717923701.
It is a cyclic number.
It is not a de Polignac number, because 505816985833 - 213 = 505816977641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505816986833) 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 3 ways as a sum of consecutive naturals, for example, 2967753 + ... + 3133558.
It is an arithmetic number, because the mean of its divisors is an integer number (126455792512).
Almost surely, 2505816985833 is an apocalyptic number.
It is an amenable number.
505816985833 is a deficient number, since it is larger than the sum of its proper divisors (6184215).
505816985833 is an equidigital number, since it uses as much as digits as its factorization.
505816985833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6184214.
The product of its (nonzero) digits is 31104000, while the sum is 61.
The spelling of 505816985833 in words is "five hundred five billion, eight hundred sixteen million, nine hundred eighty-five thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •