Base | Representation |
---|---|
bin | 11110100110000001001… |
… | …100001011011011110101 |
3 | 21102222200022200002100101 |
4 | 132212001030023123311 |
5 | 233421212023224143 |
6 | 4245455430514101 |
7 | 304615410030244 |
oct | 36460114133365 |
9 | 7388608602311 |
10 | 2102406461173 |
11 | 740697701877 |
12 | 29b563805931 |
13 | 1233437b2625 |
14 | 73a8537295b |
15 | 39a4d617b4d |
hex | 1e98130b6f5 |
2102406461173 has 4 divisors (see below), whose sum is σ = 2102412124620. Its totient is φ = 2102400797728.
The previous prime is 2102406461107. The next prime is 2102406461209. The reversal of 2102406461173 is 3711646042012.
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 1443414822084 + 658991639089 = 1201422^2 + 811783^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2102406461173 is a prime.
It is a super-2 number, since 2×21024064611732 (a number of 25 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 (2102406467173) 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, 2232640 + ... + 3031417.
It is an arithmetic number, because the mean of its divisors is an integer number (525603031155).
Almost surely, 22102406461173 is an apocalyptic number.
It is an amenable number.
2102406461173 is a deficient number, since it is larger than the sum of its proper divisors (5663447).
2102406461173 is an equidigital number, since it uses as much as digits as its factorization.
2102406461173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5663446.
The product of its (nonzero) digits is 48384, while the sum is 37.
The spelling of 2102406461173 in words is "two trillion, one hundred two billion, four hundred six million, four hundred sixty-one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •