Search a number
-
+
2101005761400 = 233352721317193161
BaseRepresentation
bin11110100100101101101…
…100111011101101111000
321102212001201000011111000
4132210231230323231320
5233410324433331100
64245104433005000
7304535611211400
oct36445554735570
97385051004430
102101005761400
11740038a85357
1229b2326b3760
1312317c54a4b0
147399131b800
15399ba685900
hex1e92db3bb78

2101005761400 has 4608 divisors, whose sum is σ = 10601321472000. Its totient is φ = 376233984000.

The previous prime is 2101005761377. The next prime is 2101005761471. The reversal of 2101005761400 is 41675001012.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 1151 ways as a sum of consecutive naturals, for example, 34442717370 + ... + 34442717430.

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

Almost surely, 22101005761400 is an apocalyptic number.

2101005761400 is a gapful number since it is divisible by the number (20) 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 2101005761400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5300660736000).

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

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

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

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

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

The product of its (nonzero) digits is 1680, while the sum is 27.

The spelling of 2101005761400 in words is "two trillion, one hundred one billion, five million, seven hundred sixty-one thousand, four hundred".