Search a number
-
+
140511035 = 5717236153
BaseRepresentation
bin10000110000000…
…00011100111011
3100210101200220102
420120000130323
5241432323120
621535350015
73324216110
oct1030003473
9323350812
10140511035
1172351025
123b08230b
1323158b32
1414938907
15c507d75
hex860073b

140511035 has 16 divisors (see below), whose sum is σ = 204037056. Its totient is φ = 90682368.

The previous prime is 140511031. The next prime is 140511047. The reversal of 140511035 is 530115041.

It is not a de Polignac number, because 140511035 - 22 = 140511031 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 140510998 and 140511016.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 117482 + ... + 118671.

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

Almost surely, 2140511035 is an apocalyptic number.

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

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

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

The sum of its prime factors is 236182.

The product of its (nonzero) digits is 300, while the sum is 20.

The square root of 140511035 is about 11853.7350653707. The cubic root of 140511035 is about 519.8804397214.

Adding to 140511035 its reverse (530115041), we get a palindrome (670626076).

The spelling of 140511035 in words is "one hundred forty million, five hundred eleven thousand, thirty-five".

Divisors: 1 5 7 17 35 85 119 595 236153 1180765 1653071 4014601 8265355 20073005 28102207 140511035