Base | Representation |
---|---|
bin | 100111000101100101101… |
… | …110100001000011011111 |
3 | 100111210012020010112012212 |
4 | 213011211232201003133 |
5 | 323002023140042311 |
6 | 5413543130351035 |
7 | 365030046635525 |
oct | 47054556410337 |
9 | 10453166115185 |
10 | 2686061252831 |
11 | 946174608420 |
12 | 3746b058b47b |
13 | 1663a9cba708 |
14 | 940128a4315 |
15 | 49d0d500c8b |
hex | 27165ba10df |
2686061252831 has 8 divisors (see below), whose sum is σ = 2930471612928. Its totient is φ = 2441688055000.
The previous prime is 2686061252741. The next prime is 2686061252837. The reversal of 2686061252831 is 1382521606862.
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 2686061252831 - 218 = 2686060990687 is a prime.
It is a super-2 number, since 2×26860612528312 (a number of 26 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 2686061252831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2686061252837) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9139325 + ... + 9428646.
It is an arithmetic number, because the mean of its divisors is an integer number (366308951616).
Almost surely, 22686061252831 is an apocalyptic number.
2686061252831 is a deficient number, since it is larger than the sum of its proper divisors (244410360097).
2686061252831 is a wasteful number, since it uses less digits than its factorization.
2686061252831 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18581133.
The product of its (nonzero) digits is 1658880, while the sum is 50.
The spelling of 2686061252831 in words is "two trillion, six hundred eighty-six billion, sixty-one million, two hundred fifty-two thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •