Search a number
-
+
53660165151 = 3171052160101
BaseRepresentation
bin110001111110011001…
…010010010000011111
312010111200001211022010
4301332121102100133
51334344000241101
640352351322303
73606514610115
oct617631222037
9163450054263
1053660165151
112083684532a
12a496820393
1350a2157018
1428508a1ab5
1515e0d8d2d6
hexc7e65241f

53660165151 has 8 divisors (see below), whose sum is σ = 75755527344. Its totient is φ = 33669123200.

The previous prime is 53660165149. The next prime is 53660165171. The reversal of 53660165151 is 15156106635.

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 53660165151 - 21 = 53660165149 is a prime.

It is a congruent number.

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

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

Almost surely, 253660165151 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1052160121.

The product of its (nonzero) digits is 81000, while the sum is 39.

The spelling of 53660165151 in words is "fifty-three billion, six hundred sixty million, one hundred sixty-five thousand, one hundred fifty-one".

Divisors: 1 3 17 51 1052160101 3156480303 17886721717 53660165151