Base | Representation |
---|---|
bin | 1111000001001000100… |
… | …11000100111000000001 |
3 | 1211022220021112210120102 |
4 | 13200210103010320001 |
5 | 31423234243243001 |
6 | 1033014403052145 |
7 | 52165041415241 |
oct | 7404423047001 |
9 | 1738807483512 |
10 | 516005056001 |
11 | 189922446a06 |
12 | 84009071055 |
13 | 39874c84406 |
14 | 1ad90b0db21 |
15 | d650cc6e6b |
hex | 78244c4e01 |
516005056001 has 8 divisors (see below), whose sum is σ = 518553171240. Its totient is φ = 513462958848.
The previous prime is 516005055971. The next prime is 516005056057. The reversal of 516005056001 is 100650500615.
It can be written as a sum of positive squares in 4 ways, for example, as 45684787600 + 470320268401 = 213740^2 + 685799^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 516005056001 - 210 = 516005054977 is a prime.
It is a super-2 number, since 2×5160050560012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (516005056901) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1332566 + ... + 1675631.
It is an arithmetic number, because the mean of its divisors is an integer number (64819146405).
Almost surely, 2516005056001 is an apocalyptic number.
It is an amenable number.
516005056001 is a deficient number, since it is larger than the sum of its proper divisors (2548115239).
516005056001 is a wasteful number, since it uses less digits than its factorization.
516005056001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3009043.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 516005056001 its reverse (100650500615), we get a palindrome (616655556616).
The spelling of 516005056001 in words is "five hundred sixteen billion, five million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •