Search a number
-
+
104696063971 = 334352315987
BaseRepresentation
bin110000110000001011…
…1110010011111100011
3101000020110010002221221
41201200113302133203
53203404143021341
6120032515555511
710364315601052
oct1414027623743
9330213102857
10104696063971
1140446220504
121835a5bbb97
139b466c2b15
1450d2a06399
152acb655ed1
hex18605f27e3

104696063971 has 8 divisors (see below), whose sum is σ = 104764898304. Its totient is φ = 104627258760.

The previous prime is 104696063957. The next prime is 104696063999. The reversal of 104696063971 is 179360696401.

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 104696063971 - 211 = 104696061923 is a prime.

It is a super-2 number, since 2×1046960639712 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (104696063911) 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, 17484240 + ... + 17490226.

It is an arithmetic number, because the mean of its divisors is an integer number (13095612288).

Almost surely, 2104696063971 is an apocalyptic number.

104696063971 is a deficient number, since it is larger than the sum of its proper divisors (68834333).

104696063971 is an equidigital number, since it uses as much as digits as its factorization.

104696063971 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 14561.

The product of its (nonzero) digits is 1469664, while the sum is 52.

The spelling of 104696063971 in words is "one hundred four billion, six hundred ninety-six million, sixty-three thousand, nine hundred seventy-one".

Divisors: 1 3343 5231 5987 17487233 20014541 31317997 104696063971