Base | Representation |
---|---|
bin | 1111000010000100111… |
… | …01001010010100010101 |
3 | 1211101012112121020111112 |
4 | 13201002131022110111 |
5 | 31430303310004323 |
6 | 1033140515344405 |
7 | 52213424125013 |
oct | 7410235122425 |
9 | 1741175536445 |
10 | 516511016213 |
11 | 18a062004345 |
12 | 8412a5b2105 |
13 | 39925a4535a |
14 | 1addbdb78b3 |
15 | d68041b178 |
hex | 784274a515 |
516511016213 has 16 divisors (see below), whose sum is σ = 567700488000. Its totient is φ = 468037406592.
The previous prime is 516511016159. The next prime is 516511016227. The reversal of 516511016213 is 312610115615.
It is a cyclic number.
It is not a de Polignac number, because 516511016213 - 226 = 516443907349 is a prime.
It is a super-2 number, since 2×5165110162132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 516511016213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (516511016243) 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 15 ways as a sum of consecutive naturals, for example, 4321448 + ... + 4439361.
It is an arithmetic number, because the mean of its divisors is an integer number (35481280500).
Almost surely, 2516511016213 is an apocalyptic number.
It is an amenable number.
516511016213 is a deficient number, since it is larger than the sum of its proper divisors (51189471787).
516511016213 is a wasteful number, since it uses less digits than its factorization.
516511016213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8760964.
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 516511016213 in words is "five hundred sixteen billion, five hundred eleven million, sixteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •