Base | Representation |
---|---|
bin | 110000110101011100… |
… | …1110101101010000101 |
3 | 101000200202121022001222 |
4 | 1201222321311222011 |
5 | 3204234411340424 |
6 | 120102231130125 |
7 | 10401562524452 |
oct | 1415271655205 |
9 | 330622538058 |
10 | 104872761989 |
11 | 40526a38326 |
12 | 183a9813945 |
13 | 9b741aba68 |
14 | 510c280829 |
15 | 2adbe0ae5e |
hex | 186ae75a85 |
104872761989 has 8 divisors (see below), whose sum is σ = 105238288320. Its totient is φ = 104507768736.
The previous prime is 104872761977. The next prime is 104872761991. The reversal of 104872761989 is 989167278401.
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 104872761989 - 28 = 104872761733 is a prime.
It is a super-2 number, since 2×1048727619892 (a number of 23 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 (104872761689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262922 + ... + 528084.
It is an arithmetic number, because the mean of its divisors is an integer number (13154786040).
Almost surely, 2104872761989 is an apocalyptic number.
It is an amenable number.
104872761989 is a deficient number, since it is larger than the sum of its proper divisors (365526331).
104872761989 is an equidigital number, since it uses as much as digits as its factorization.
104872761989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266539.
The product of its (nonzero) digits is 12192768, while the sum is 62.
The spelling of 104872761989 in words is "one hundred four billion, eight hundred seventy-two million, seven hundred sixty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •