Base | Representation |
---|---|
bin | 11110100110001111101… |
… | …111110001001001111111 |
3 | 21110000022100012021021022 |
4 | 132212033233301021333 |
5 | 233422212032443433 |
6 | 4245535553054355 |
7 | 304624433550356 |
oct | 36461757611177 |
9 | 7400270167238 |
10 | 2102650671743 |
11 | 740802540896 |
12 | 29b6115573bb |
13 | 123382278b1b |
14 | 73aa998299d |
15 | 39a64ca6698 |
hex | 1e98fbf127f |
2102650671743 has 4 divisors (see below), whose sum is σ = 2102662610400. Its totient is φ = 2102638733088.
The previous prime is 2102650671701. The next prime is 2102650671757. The reversal of 2102650671743 is 3471760562012.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2102650671743 - 210 = 2102650670719 is a prime.
It is a super-2 number, since 2×21026506717432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102650671694 and 2102650671703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102650679743) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5701130 + ... + 6058727.
It is an arithmetic number, because the mean of its divisors is an integer number (525665652600).
Almost surely, 22102650671743 is an apocalyptic number.
2102650671743 is a deficient number, since it is larger than the sum of its proper divisors (11938657).
2102650671743 is a wasteful number, since it uses less digits than its factorization.
2102650671743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11938656.
The product of its (nonzero) digits is 423360, while the sum is 44.
The spelling of 2102650671743 in words is "two trillion, one hundred two billion, six hundred fifty million, six hundred seventy-one thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •