Search a number
-
+
10200111220102 = 25100055610051
BaseRepresentation
bin1001010001101110011000…
…0000011000010110000110
31100010010021021210111121211
42110123212000120112012
52314104311433020402
633405511051002034
72101635156554206
oct224334600302606
940103237714554
1010200111220102
11328292a95a561
121188a2473931a
1358cb355191bb
1427398bcc2406
1512a4dd0364d7
hex946e6018586

10200111220102 has 4 divisors (see below), whose sum is σ = 15300166830156. Its totient is φ = 5100055610050.

The previous prime is 10200111220043. The next prime is 10200111220109. The reversal of 10200111220102 is 20102211100201.

It is a semiprime because it is the product of two primes.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10200111220109) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550027805024 + ... + 2550027805027.

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

Almost surely, 210200111220102 is an apocalyptic number.

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

10200111220102 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5100055610053.

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 10200111220102 its reverse (20102211100201), we get a palindrome (30302322320303).

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

Divisors: 1 2 5100055610051 10200111220102