Search a number
-
+
10132212010200 = 23352741271217121
BaseRepresentation
bin1001001101110001011011…
…1001011100110011011000
31022212122000021110020222220
42103130112321130303120
52312001232233311300
633314401323144040
72064012442032060
oct223342671346330
938778007406886
1010132212010200
113257057596155
121177835375020
135866043a8217
1427058a2c03a0
15128867096da0
hex93716e5ccd8

10132212010200 has 384 divisors, whose sum is σ = 36908377712640. Its totient is φ = 2251100160000.

The previous prime is 10132212010187. The next prime is 10132212010211. The reversal of 10132212010200 is 201021223101.

It is a super-2 number, since 2×101322120102002 (a number of 27 digits) contains 22 as substring.

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

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

It is a congruent number.

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 95 ways as a sum of consecutive naturals, for example, 46557640 + ... + 46774760.

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

Almost surely, 210132212010200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 48, while the sum is 15.

Adding to 10132212010200 its reverse (201021223101), we get a palindrome (10333233233301).

The spelling of 10132212010200 in words is "ten trillion, one hundred thirty-two billion, two hundred twelve million, ten thousand, two hundred".