Base | Representation |
---|---|
bin | 11110110110011101001… |
… | …110100001001010010101 |
3 | 21111200020101201102001002 |
4 | 132312131032201022111 |
5 | 234213334004040220 |
6 | 4301535100513045 |
7 | 306111660444122 |
oct | 36663516411225 |
9 | 7450211642032 |
10 | 2120056705685 |
11 | 748124816806 |
12 | 2a2a6a84b785 |
13 | 124bc74140a9 |
14 | 7487b557749 |
15 | 3a232e34c75 |
hex | 1ed9d3a1295 |
2120056705685 has 8 divisors (see below), whose sum is σ = 2544079212600. Its totient is φ = 1696037920704.
The previous prime is 2120056705639. The next prime is 2120056705687. The reversal of 2120056705685 is 5865076500212.
It can be written as a sum of positive squares in 4 ways, for example, as 297877991524 + 1822178714161 = 545782^2 + 1349881^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2120056705685 is a prime.
It is a super-2 number, since 2×21200567056852 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120056705687) 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, 531491 + ... + 2126639.
It is an arithmetic number, because the mean of its divisors is an integer number (318009901575).
Almost surely, 22120056705685 is an apocalyptic number.
It is an amenable number.
2120056705685 is a deficient number, since it is larger than the sum of its proper divisors (424022506915).
2120056705685 is a wasteful number, since it uses less digits than its factorization.
2120056705685 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1860967.
The product of its (nonzero) digits is 1008000, while the sum is 47.
The spelling of 2120056705685 in words is "two trillion, one hundred twenty billion, fifty-six million, seven hundred five thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •