Search a number
-
+
100130200011 = 3223483720773
BaseRepresentation
bin101110101000000111…
…0011001100111001011
3100120110020122012002100
41131100032121213023
53120031312400021
6113555453404443
710143214441242
oct1352016314713
9316406565070
10100130200011
1139512984316
12174a5499723
13959979827a
144bbc473959
1529108a7626
hex17503999cb

100130200011 has 12 divisors (see below), whose sum is σ = 150920881488. Its totient is φ = 63851141904.

The previous prime is 100130199979. The next prime is 100130200031. The reversal of 100130200011 is 110002031001.

It is not a de Polignac number, because 100130200011 - 25 = 100130199979 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 100130199966 and 100130200002.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 241860180 + ... + 241860593.

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

Almost surely, 2100130200011 is an apocalyptic number.

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

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

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

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

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

Adding to 100130200011 its reverse (110002031001), we get a palindrome (210132231012).

The spelling of 100130200011 in words is "one hundred billion, one hundred thirty million, two hundred thousand, eleven".

Divisors: 1 3 9 23 69 207 483720773 1451162319 4353486957 11125577779 33376733337 100130200011