Search a number
-
+
100910000113 = 1347165155483
BaseRepresentation
bin101110111111010110…
…1000110011111110001
3100122110120222010201121
41131332231012133301
53123130430000423
6114205111302241
710201433564026
oct1357655063761
9318416863647
10100910000113
113988307870a
121768267a981
1396921c7a50
144c53c6154d
15295908e45d
hex177eb467f1

100910000113 has 8 divisors (see below), whose sum is σ = 110984485248. Its totient is φ = 91165826064.

The previous prime is 100910000111. The next prime is 100910000131. The reversal of 100910000113 is 311000019001.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 100910000113 - 21 = 100910000111 is a prime.

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

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

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

Almost surely, 2100910000113 is an apocalyptic number.

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

It is an amenable number.

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

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

100910000113 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 165155543.

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

Adding to 100910000113 its reverse (311000019001), we get a palindrome (411910019114).

The spelling of 100910000113 in words is "one hundred billion, nine hundred ten million, one hundred thirteen", and thus it is an aban number.

Divisors: 1 13 47 611 165155483 2147021279 7762307701 100910000113