Search a number
-
+
195039291765 = 3513002619451
BaseRepresentation
bin1011010110100100111…
…1110110100101110101
3200122102121211121002210
42311221033312211311
511143420024314030
6225333320524033
720043153424533
oct2655117664565
9618377747083
10195039291765
117579666072a
1231972320619
1315513669966
14962332b153
155117bcebb0
hex2d693f6975

195039291765 has 8 divisors (see below), whose sum is σ = 312062866848. Its totient is φ = 104020955600.

The previous prime is 195039291709. The next prime is 195039291781. The reversal of 195039291765 is 567192930591.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 195039291765 - 27 = 195039291637 is a prime.

It is a super-3 number, since 3×1950392917653 (a number of 35 digits) contains 333 as substring.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6501309711 + ... + 6501309740.

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

Almost surely, 2195039291765 is an apocalyptic number.

195039291765 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 13002619459.

The product of its (nonzero) digits is 4592700, while the sum is 57.

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

Divisors: 1 3 5 15 13002619451 39007858353 65013097255 195039291765