Base | Representation |
---|---|
bin | 100111000000101001001… |
… | …110110001001100110101 |
3 | 100111021111011120111121001 |
4 | 213000221032301030311 |
5 | 322410134320030401 |
6 | 5411304204323301 |
7 | 364451342223325 |
oct | 47005116611465 |
9 | 10437434514531 |
10 | 2680751330101 |
11 | 94399a269929 |
12 | 37366a243531 |
13 | 165a41b986c0 |
14 | 93a6b5a9285 |
15 | 49aec27a601 |
hex | 270293b1335 |
2680751330101 has 4 divisors (see below), whose sum is σ = 2886962970892. Its totient is φ = 2474539689312.
The previous prime is 2680751330071. The next prime is 2680751330141. The reversal of 2680751330101 is 1010331570862.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1326530366001 + 1354220964100 = 1151751^2 + 1163710^2 .
It is a cyclic number.
It is not a de Polignac number, because 2680751330101 - 29 = 2680751329589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2680751330141) 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, 103105820376 + ... + 103105820401.
It is an arithmetic number, because the mean of its divisors is an integer number (721740742723).
Almost surely, 22680751330101 is an apocalyptic number.
It is an amenable number.
2680751330101 is a deficient number, since it is larger than the sum of its proper divisors (206211640791).
2680751330101 is a wasteful number, since it uses less digits than its factorization.
2680751330101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206211640790.
The product of its (nonzero) digits is 30240, while the sum is 37.
The spelling of 2680751330101 in words is "two trillion, six hundred eighty billion, seven hundred fifty-one million, three hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •