Base | Representation |
---|---|
bin | 11110110010100… |
… | …000010011100001 |
3 | 1022222222202121202 |
4 | 132302200103201 |
5 | 2024214243001 |
6 | 123131330545 |
7 | 15541440113 |
oct | 3662402341 |
9 | 1288882552 |
10 | 516556001 |
11 | 245645195 |
12 | 124bb0a55 |
13 | 83030a50 |
14 | 4c8653b3 |
15 | 3053896b |
hex | 1eca04e1 |
516556001 has 8 divisors (see below), whose sum is σ = 571326504. Its totient is φ = 463933440.
The previous prime is 516555973. The next prime is 516556003. The reversal of 516556001 is 100655615.
It can be written as a sum of positive squares in 4 ways, for example, as 262472401 + 254083600 = 16201^2 + 15940^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-516556001 is a prime.
It is a super-2 number, since 2×5165560012 = 533660204338224002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (516556003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 536480 + ... + 537441.
It is an arithmetic number, because the mean of its divisors is an integer number (71415813).
Almost surely, 2516556001 is an apocalyptic number.
It is an amenable number.
516556001 is a deficient number, since it is larger than the sum of its proper divisors (54770503).
516556001 is a wasteful number, since it uses less digits than its factorization.
516556001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073971.
The product of its (nonzero) digits is 4500, while the sum is 29.
The square root of 516556001 is about 22727.8683778308. The cubic root of 516556001 is about 802.3659133574.
The spelling of 516556001 in words is "five hundred sixteen million, five hundred fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •