Search a number
-
+
100001001110103 = 3229383145598123
BaseRepresentation
bin10110101111001101001100…
…001001011111101001010111
3111010002000001201002012011200
4112233031030021133221113
5101101404022241010403
6552403454204003543
730030556013345502
oct2657151411375127
9433060051065150
10100001001110103
1129955206118aa5
12b270a44b305b3
1343a50916814a2
141a9a107b6c139
15b863c761eca3
hex5af34c25fa57

100001001110103 has 12 divisors (see below), whose sum is σ = 149426783268360. Its totient is φ = 64368460484496.

The previous prime is 100001001110071. The next prime is 100001001110111. The reversal of 100001001110103 is 301011100100001.

It is not a de Polignac number, because 100001001110103 - 25 = 100001001110071 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100001001110103 is an apocalyptic number.

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

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

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

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

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

Adding to 100001001110103 its reverse (301011100100001), we get a palindrome (401012101210104).

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

Divisors: 1 3 9 29 87 261 383145598123 1149436794369 3448310383107 11111222345567 33333667036701 100001001110103