Base | Representation |
---|---|
bin | 1111000001110111111… |
… | …11011010001100101001 |
3 | 1211100220222111202211020 |
4 | 13200323333122030221 |
5 | 31430043023204031 |
6 | 1033122042523053 |
7 | 52210636165422 |
oct | 7407377321451 |
9 | 1740828452736 |
10 | 516402553641 |
11 | 18a006862857 |
12 | 840ba206489 |
13 | 3990942aa10 |
14 | 1adcb822649 |
15 | d675b44096 |
hex | 783bfda329 |
516402553641 has 16 divisors (see below), whose sum is σ = 741555200064. Its totient is φ = 317763002304.
The previous prime is 516402553637. The next prime is 516402553669. The reversal of 516402553641 is 146355204615.
It is not a de Polignac number, because 516402553641 - 22 = 516402553637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 516402553593 and 516402553602.
It is not an unprimeable number, because it can be changed into a prime (516402553741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66315 + ... + 1018431.
It is an arithmetic number, because the mean of its divisors is an integer number (46347200004).
Almost surely, 2516402553641 is an apocalyptic number.
It is an amenable number.
516402553641 is a deficient number, since it is larger than the sum of its proper divisors (225152646423).
516402553641 is a wasteful number, since it uses less digits than its factorization.
516402553641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 966040.
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 516402553641 in words is "five hundred sixteen billion, four hundred two million, five hundred fifty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •