Base | Representation |
---|---|
bin | 11110101001110101100… |
… | …101010010000011010101 |
3 | 21110101021001221220201112 |
4 | 132221311211102003111 |
5 | 234003111202320311 |
6 | 4251414340504405 |
7 | 305122125240440 |
oct | 36516545220325 |
9 | 7411231856645 |
10 | 2106506682581 |
11 | 742401118904 |
12 | 2a03089ab105 |
13 | 1238480c4542 |
14 | 73d53b34657 |
15 | 39bdd58828b |
hex | 1ea759520d5 |
2106506682581 has 8 divisors (see below), whose sum is σ = 2407549685760. Its totient is φ = 1805492048688.
The previous prime is 2106506682569. The next prime is 2106506682661. The reversal of 2106506682581 is 1852866056012.
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-2106506682581 is a prime.
It is a super-2 number, since 2×21065066825812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2106506682881) 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, 6932966 + ... + 7230423.
It is an arithmetic number, because the mean of its divisors is an integer number (300943710720).
Almost surely, 22106506682581 is an apocalyptic number.
It is an amenable number.
2106506682581 is a deficient number, since it is larger than the sum of its proper divisors (301043003179).
2106506682581 is a wasteful number, since it uses less digits than its factorization.
2106506682581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14184643.
The product of its (nonzero) digits is 1382400, while the sum is 50.
The spelling of 2106506682581 in words is "two trillion, one hundred six billion, five hundred six million, six hundred eighty-two thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •