Search a number
-
+
102077566052770 = 2574112199383461
BaseRepresentation
bin10111001101011011001001…
…000100000110100110100010
3111101102112001002101010100001
4113031123021010012212202
5101334414323402142040
61001033441513250214
730333601150210000
oct2715331104064642
9441375032333301
10102077566052770
112a585941975500
12b54739640396a
1344c5b4749b959
141b2c81b0a1a70
15bc041223b59a
hex5cd6c91069a2

102077566052770 has 480 divisors, whose sum is σ = 237925204070400. Its totient is φ = 31505358931200.

The previous prime is 102077566052753. The next prime is 102077566052771. The reversal of 102077566052770 is 77250665770201.

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

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

It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 221426390340 + ... + 221426390800.

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

Almost surely, 2102077566052770 is an apocalyptic number.

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

102077566052770 is an abundant number, since it is smaller than the sum of its proper divisors (135847638017630).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 8643600, while the sum is 55.

The spelling of 102077566052770 in words is "one hundred two trillion, seventy-seven billion, five hundred sixty-six million, fifty-two thousand, seven hundred seventy".