Base | Representation |
---|---|
bin | 11110110000011… |
… | …101011101110001 |
3 | 1022221222112110212 |
4 | 132300131131301 |
5 | 2024100120311 |
6 | 123112033505 |
7 | 15534045503 |
oct | 3660353561 |
9 | 1287875425 |
10 | 516020081 |
11 | 245309585 |
12 | 124992895 |
13 | 82ba3b35 |
14 | 4c765d73 |
15 | 3047ec8b |
hex | 1ec1d771 |
516020081 has 4 divisors (see below), whose sum is σ = 528020592. Its totient is φ = 504019572.
The previous prime is 516020053. The next prime is 516020083. The reversal of 516020081 is 180020615.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-516020081 is a prime.
It is a super-2 number, since 2×5160200812 = 532553447990493122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (516020083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6000191 + ... + 6000276.
It is an arithmetic number, because the mean of its divisors is an integer number (132005148).
Almost surely, 2516020081 is an apocalyptic number.
It is an amenable number.
516020081 is a deficient number, since it is larger than the sum of its proper divisors (12000511).
516020081 is a wasteful number, since it uses less digits than its factorization.
516020081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12000510.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 516020081 is about 22716.0753872671. The cubic root of 516020081 is about 802.0883360099.
Adding to 516020081 its reverse (180020615), we get a palindrome (696040696).
The spelling of 516020081 in words is "five hundred sixteen million, twenty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •