Base | Representation |
---|---|
bin | 100101001110101001101… |
… | …1110111110001000001101 |
3 | 200010011010002022121102101 |
4 | 1022131103132332020031 |
5 | 1132313003402133021 |
6 | 14514325501355101 |
7 | 1035445522102414 |
oct | 112352336761015 |
9 | 20104102277371 |
10 | 5116706677261 |
11 | 16a2a8a588553 |
12 | 6a779a868a91 |
13 | 2b1670b9664a |
14 | 13991557047b |
15 | 8d16d4e2a91 |
hex | 4a7537be20d |
5116706677261 has 8 divisors (see below), whose sum is σ = 5339223757440. Its totient is φ = 4894193894832.
The previous prime is 5116706677231. The next prime is 5116706677267. The reversal of 5116706677261 is 1627766076115.
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 5116706677261 - 231 = 5114559193613 is a prime.
It is a super-2 number, since 2×51167066772612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5116706677267) 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 7 ways as a sum of consecutive naturals, for example, 1488555 + ... + 3528343.
It is an arithmetic number, because the mean of its divisors is an integer number (667402969680).
Almost surely, 25116706677261 is an apocalyptic number.
It is an amenable number.
5116706677261 is a deficient number, since it is larger than the sum of its proper divisors (222517080179).
5116706677261 is a wasteful number, since it uses less digits than its factorization.
5116706677261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2148875.
The product of its (nonzero) digits is 4445280, while the sum is 55.
The spelling of 5116706677261 in words is "five trillion, one hundred sixteen billion, seven hundred six million, six hundred seventy-seven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •