Search a number
-
+
33195969105 = 35131724783151
BaseRepresentation
bin11110111010101000…
…100100101001010001
310011200111001221210020
4132322220210221101
51020441132002410
623130000454053
72253425040015
oct367250445121
9104614057706
1033195969105
1113095293a12
12652531a329
133190551c90
14186caa4545
15ce44cca70
hex7baa24a51

33195969105 has 192 divisors, whose sum is σ = 63218147328. Its totient is φ = 14774169600.

The previous prime is 33195969089. The next prime is 33195969109. The reversal of 33195969105 is 50196959133.

It is not a de Polignac number, because 33195969105 - 24 = 33195969089 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (51).

It is not an unprimeable number, because it can be changed into a prime (33195969109) 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 in 191 ways as a sum of consecutive naturals, for example, 219840780 + ... + 219840930.

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

Almost surely, 233195969105 is an apocalyptic number.

It is an amenable number.

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

33195969105 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 336 (or 319 counting only the distinct ones).

The product of its (nonzero) digits is 984150, while the sum is 51.

The spelling of 33195969105 in words is "thirty-three billion, one hundred ninety-five million, nine hundred sixty-nine thousand, one hundred five".