Search a number
-
+
109500001 = 1322392711
BaseRepresentation
bin1101000011011…
…01011001100001
321122001011202121
412201231121201
5211013000001
614510544241
72466506662
oct641553141
9248034677
10109500001
115689aa76
1230808081
13198bb900
1410785369
15992e6a1
hex686d661

109500001 has 12 divisors (see below), whose sum is σ = 119111040. Its totient is φ = 100616880.

The previous prime is 109499953. The next prime is 109500007. The reversal of 109500001 is 100005901.

It is a de Polignac number, because none of the positive numbers 2k-109500001 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (109500007) 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 11 ways as a sum of consecutive naturals, for example, 39036 + ... + 41746.

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

Almost surely, 2109500001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 109500001 is about 10464.2248160100. The cubic root of 109500001 is about 478.4149117123.

Adding to 109500001 its reverse (100005901), we get a palindrome (209505902).

The spelling of 109500001 in words is "one hundred nine million, five hundred thousand, one".

Divisors: 1 13 169 239 2711 3107 35243 40391 458159 647929 8423077 109500001