Search a number
-
+
10002657027000 = 23353112197319867
BaseRepresentation
bin1001000110001110110011…
…0100011010001110111000
31022102020121100220012122210
42101203230310122032320
52302340420144331000
633135053542215120
72051445110610561
oct221435464321670
938366540805583
1010002657027000
113207115139800
1211566b97244a0
13577328777151
142681b9d77168
151252d333a350
hex918ecd1a3b8

10002657027000 has 768 divisors, whose sum is σ = 36605248243200. Its totient is φ = 2265677568000.

The previous prime is 10002657026977. The next prime is 10002657027017. The reversal of 10002657027000 is 72075620001.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 503471067 + ... + 503490933.

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

Almost surely, 210002657027000 is an apocalyptic number.

10002657027000 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 10002657027000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18302624121600).

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

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

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

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

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

The product of its (nonzero) digits is 5880, while the sum is 30.

The spelling of 10002657027000 in words is "ten trillion, two billion, six hundred fifty-seven million, twenty-seven thousand".