Search a number
-
+
10200210101110 = 255669179929619
BaseRepresentation
bin1001010001101110101111…
…1001100101001101110110
31100010010112011212011212101
42110123223321211031312
52314110012241213420
633405524542212314
72101640500206061
oct224335371451566
940103464764771
1010200210101110
1132829807572a7
121188a5188409a
1358cb4cb5a583
1427399b0a18d8
1512a4e6a6960a
hex946ebe65376

10200210101110 has 16 divisors (see below), whose sum is σ = 18363617017200. Its totient is φ = 4079364299296.

The previous prime is 10200210101083. The next prime is 10200210101153. The reversal of 10200210101110 is 1110101200201.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89908120 + ... + 90021499.

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

Almost surely, 210200210101110 is an apocalyptic number.

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

10200210101110 is a deficient number, since it is larger than the sum of its proper divisors (8163406916090).

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

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

The sum of its prime factors is 179935295.

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

Adding to 10200210101110 its reverse (1110101200201), we get a palindrome (11310311301311).

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

Divisors: 1 2 5 10 5669 11338 28345 56690 179929619 359859238 899648095 1799296190 1020021010111 2040042020222 5100105050555 10200210101110