Base | Representation |
---|---|
bin | 1111001000110000110… |
… | …00011011101001101100 |
3 | 1211201110200002121212012 |
4 | 13210120120123221230 |
5 | 32010131111210331 |
6 | 1034533010100352 |
7 | 52401364625150 |
oct | 7443030335154 |
9 | 1751420077765 |
10 | 520100100716 |
11 | 190633a47689 |
12 | 8497057a6b8 |
13 | 3a0784a2cb1 |
14 | 1b25c925060 |
15 | d7e057382b |
hex | 791861ba6c |
520100100716 has 12 divisors (see below), whose sum is σ = 1040200201488. Its totient is φ = 222900043152.
The previous prime is 520100100703. The next prime is 520100100719. The reversal of 520100100716 is 617001001025.
520100100716 is an admirable number.
It is a super-2 number, since 2×5201001007162 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 520100100691 and 520100100700.
It is not an unprimeable number, because it can be changed into a prime (520100100719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9287501771 + ... + 9287501826.
It is an arithmetic number, because the mean of its divisors is an integer number (86683350124).
Almost surely, 2520100100716 is an apocalyptic number.
It is an amenable number.
520100100716 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520100100716 is a wasteful number, since it uses less digits than its factorization.
520100100716 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18575003608 (or 18575003606 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 23.
The spelling of 520100100716 in words is "five hundred twenty billion, one hundred million, one hundred thousand, seven hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •