Search a number
-
+
1360410172100 = 2252723161146819
BaseRepresentation
bin10011110010111110110…
…000111101101011000100
311211001110022202011022122
4103302332300331223010
5134242110001001400
62520544103145112
7200200142445200
oct23627660755304
94731408664278
101360410172100
11484a46092661
1219b7a6745198
139b394817bc5
1449bb66cdb00
15255c269a685
hex13cbec3dac4

1360410172100 has 216 divisors, whose sum is σ = 3602976894720. Its totient is φ = 443977632000.

The previous prime is 1360410172063. The next prime is 1360410172111. The reversal of 1360410172100 is 12710140631.

It is a self number, because there is not a number n which added to its sum of digits gives 1360410172100.

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 71 ways as a sum of consecutive naturals, for example, 9192491 + ... + 9339309.

Almost surely, 21360410172100 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1360410172100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1801488447360).

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

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

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

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

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

The product of its (nonzero) digits is 1008, while the sum is 26.

The spelling of 1360410172100 in words is "one trillion, three hundred sixty billion, four hundred ten million, one hundred seventy-two thousand, one hundred".