Base | Representation |
---|---|
bin | 1100011111010… |
… | …00101001101011 |
3 | 21022010110101201 |
4 | 12033220221223 |
5 | 203304340323 |
6 | 14221225031 |
7 | 2411314315 |
oct | 617505153 |
9 | 238113351 |
10 | 104761963 |
11 | 54154239 |
12 | 2b102177 |
13 | 18920137 |
14 | dcb07b5 |
15 | 92e58ad |
hex | 63e8a6b |
104761963 has 4 divisors (see below), whose sum is σ = 104786968. Its totient is φ = 104736960.
The previous prime is 104761957. The next prime is 104761967. The reversal of 104761963 is 369167401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104761963 - 29 = 104761451 is a prime.
It is a super-2 number, since 2×1047619632 = 21950137783226738, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104761967) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4518 + ... + 15163.
It is an arithmetic number, because the mean of its divisors is an integer number (26196742).
Almost surely, 2104761963 is an apocalyptic number.
104761963 is a deficient number, since it is larger than the sum of its proper divisors (25005).
104761963 is an equidigital number, since it uses as much as digits as its factorization.
104761963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25004.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 104761963 is about 10235.3291593383. The cubic root of 104761963 is about 471.4126248880.
The spelling of 104761963 in words is "one hundred four million, seven hundred sixty-one thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •