Search a number
-
+
100010100091 = 1131909132261
BaseRepresentation
bin101110100100100010…
…0010000010101111011
3100120010212122110222011
41131021010100111323
53114310041200331
6113535523310351
710140225552556
oct1351104202573
9316125573864
10100010100091
1139461104490
121747121b3b7
13957a937a25
144baa52d69d
1529050823b1
hex174911057b

100010100091 has 16 divisors (see below), whose sum is σ = 112637223936. Its totient is φ = 87973020000.

The previous prime is 100010100079. The next prime is 100010100109. The reversal of 100010100091 is 190001010001.

It is a cyclic number.

It is not a de Polignac number, because 100010100091 - 27 = 100010099963 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (100010100011) 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 in 15 ways as a sum of consecutive naturals, for example, 3083901 + ... + 3116161.

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

Almost surely, 2100010100091 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 41394.

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

Adding to 100010100091 its reverse (190001010001), we get a palindrome (290011110092).

The spelling of 100010100091 in words is "one hundred billion, ten million, one hundred thousand, ninety-one".

Divisors: 1 11 31 341 9091 32261 100001 281821 354871 1000091 3100031 11001001 293284751 3226132261 9091827281 100010100091