Search a number
-
+
1100100151 = 4143361967
BaseRepresentation
bin100000110010010…
…0011001000110111
32211200000212201001
41001210203020313
54223111201101
6301054544131
736155461033
oct10144431067
92750025631
101100100151
11514a83587
12268508047
13146bb7447
14a61671c3
15668a5901
hex41923237

1100100151 has 8 divisors (see below), whose sum is σ = 1129552704. Its totient is φ = 1070772480.

The previous prime is 1100100149. The next prime is 1100100167. The reversal of 1100100151 is 1510010011.

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 1100100151 - 21 = 1100100149 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 21100100151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 62441.

The product of its (nonzero) digits is 5, while the sum is 10.

The square root of 1100100151 is about 33167.7577023229. The cubic root of 1100100151 is about 1032.3114429559.

Adding to 1100100151 its reverse (1510010011), we get a palindrome (2610110162).

The spelling of 1100100151 in words is "one billion, one hundred million, one hundred thousand, one hundred fifty-one".

Divisors: 1 41 433 17753 61967 2540647 26831711 1100100151