Search a number
-
+
1001102110200 = 23325217319716319
BaseRepresentation
bin11101001000101100101…
…01011110110111111000
310112201000112020102110100
432210112111132313320
5112400224120011300
62043522220315400
7132220146351213
oct16442625366770
93481015212410
101001102110200
11356624051675
1214202b0a2b60
1373532707b5a
143664c97477a
151b0933b7700
hexe91655edf8

1001102110200 has 288 divisors, whose sum is σ = 3398841388800. Its totient is φ = 264053959680.

The previous prime is 1001102110163. The next prime is 1001102110237. The reversal of 1001102110200 is 20112011001.

It is a happy number.

It is an interprime number because it is at equal distance from previous prime (1001102110163) and next prime (1001102110237).

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

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

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

Almost surely, 21001102110200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 1001102110200 its reverse (20112011001), we get a palindrome (1021214121201).

It can be divided in two parts, 1001 and 102110200, that added together give a palindrome (102111201).

The spelling of 1001102110200 in words is "one trillion, one billion, one hundred two million, one hundred ten thousand, two hundred".