Base | Representation |
---|---|
bin | 110001110010000001… |
… | …1000000111110110101 |
3 | 101012221102000101201001 |
4 | 1203210003000332311 |
5 | 3222420213221210 |
6 | 121040033403301 |
7 | 10503132204301 |
oct | 1434403007665 |
9 | 335842011631 |
10 | 106905210805 |
11 | 4137a228198 |
12 | 18876409531 |
13 | a1092a78b3 |
14 | 5262184d01 |
15 | 2baa57d03a |
hex | 18e40c0fb5 |
106905210805 has 8 divisors (see below), whose sum is σ = 128564533944. Its totient is φ = 85338648000.
The previous prime is 106905210793. The next prime is 106905210871. The reversal of 106905210805 is 508012509601.
It can be written as a sum of positive squares in 4 ways, for example, as 6589218276 + 100315992529 = 81174^2 + 316727^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106905210805 - 25 = 106905210773 is a prime.
It is a super-3 number, since 3×1069052108053 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23187546 + ... + 23192155.
It is an arithmetic number, because the mean of its divisors is an integer number (16070566743).
Almost surely, 2106905210805 is an apocalyptic number.
It is an amenable number.
106905210805 is a deficient number, since it is larger than the sum of its proper divisors (21659323139).
106905210805 is an equidigital number, since it uses as much as digits as its factorization.
106905210805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46380167.
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 106905210805 in words is "one hundred six billion, nine hundred five million, two hundred ten thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •