Base | Representation |
---|---|
bin | 110001010011010110… |
… | …0000010001000001001 |
3 | 101010021122221200122101 |
4 | 1202212230002020021 |
5 | 3213313144313014 |
6 | 120345541153401 |
7 | 10435462150543 |
oct | 1424654021011 |
9 | 333248850571 |
10 | 105875776009 |
11 | 409a112a633 |
12 | 186296bb861 |
13 | 9ca3c32a93 |
14 | 51a5574693 |
15 | 2b49ed5474 |
hex | 18a6b02209 |
105875776009 has 8 divisors (see below), whose sum is σ = 105944829120. Its totient is φ = 105806752176.
The previous prime is 105875775989. The next prime is 105875776067. The reversal of 105875776009 is 900677578501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105875776009 - 221 = 105873678857 is a prime.
It is a super-3 number, since 3×1058757760093 (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 not an unprimeable number, because it can be changed into a prime (105875776309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15896322 + ... + 15902980.
It is an arithmetic number, because the mean of its divisors is an integer number (13243103640).
Almost surely, 2105875776009 is an apocalyptic number.
It is an amenable number.
105875776009 is a deficient number, since it is larger than the sum of its proper divisors (69053111).
105875776009 is an equidigital number, since it uses as much as digits as its factorization.
105875776009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14639.
The product of its (nonzero) digits is 3704400, while the sum is 55.
The spelling of 105875776009 in words is "one hundred five billion, eight hundred seventy-five million, seven hundred seventy-six thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •