Base | Representation |
---|---|
bin | 110000011011110000… |
… | …0000100111011010011 |
3 | 100221110122212021201111 |
4 | 1200313200010323103 |
5 | 3201003123331041 |
6 | 115440503114151 |
7 | 10341321364366 |
oct | 1406740047323 |
9 | 327418767644 |
10 | 104010370771 |
11 | 4012416300a |
12 | 181a8a42957 |
13 | 9a676226b8 |
14 | 50699140dd |
15 | 2a8b35c981 |
hex | 1837804ed3 |
104010370771 has 2 divisors, whose sum is σ = 104010370772. Its totient is φ = 104010370770.
The previous prime is 104010370769. The next prime is 104010370777. The reversal of 104010370771 is 177073010401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 104010370771 - 21 = 104010370769 is a prime.
It is a super-2 number, since 2×1040103707712 (a number of 23 digits) contains 22 as substring.
Together with 104010370769, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (104010370777) by changing a digit.
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 as a sum of consecutive naturals, namely, 52005185385 + 52005185386.
It is an arithmetic number, because the mean of its divisors is an integer number (52005185386).
Almost surely, 2104010370771 is an apocalyptic number.
104010370771 is a deficient number, since it is larger than the sum of its proper divisors (1).
104010370771 is an equidigital number, since it uses as much as digits as its factorization.
104010370771 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4116, while the sum is 31.
The spelling of 104010370771 in words is "one hundred four billion, ten million, three hundred seventy thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •