Search a number
-
+
102016660610157 = 373465829500503
BaseRepresentation
bin10111001100100010011010…
…110100010001110001101101
3111101012200211111001001211020
4113030202122310101301231
5101332420110104011112
61000545450142244353
730326313644404626
oct2714423264216155
9441180744031736
10102016660610157
112a562028388a67
12b5376192866b9
1344c018c290a07
141b298c0276a4d
15bbda4a28448c
hex5cc89ad11c6d

102016660610157 has 8 divisors (see below), whose sum is σ = 137885532149184. Its totient is φ = 67079448072288.

The previous prime is 102016660610141. The next prime is 102016660610167. The reversal of 102016660610157 is 751016066610201.

It is a happy number.

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

It is not a de Polignac number, because 102016660610157 - 24 = 102016660610141 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (102016660610167) by changing a digit.

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, 232914750033 + ... + 232914750470.

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

Almost surely, 2102016660610157 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 465829500579.

The product of its (nonzero) digits is 90720, while the sum is 42.

The spelling of 102016660610157 in words is "one hundred two trillion, sixteen billion, six hundred sixty million, six hundred ten thousand, one hundred fifty-seven".

Divisors: 1 3 73 219 465829500503 1397488501509 34005553536719 102016660610157