Search a number
-
+
140951019 = 31137241479
BaseRepresentation
bin10000110011010…
…11110111101011
3100211020001110010
420121223313223
5242040413034
621553023003
73331030626
oct1031536753
9324201403
10140951019
1172621650
123b254a63
1323281191
1414a10dbd
15c5933e9
hex866bdeb

140951019 has 32 divisors (see below), whose sum is σ = 211875840. Its totient is φ = 82598400.

The previous prime is 140951011. The next prime is 140951021. The reversal of 140951019 is 910159041.

It is not a de Polignac number, because 140951019 - 23 = 140951011 is a prime.

It is a super-2 number, since 2×1409510192 = 39734379514276722, which contains 22 as substring.

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

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

Almost surely, 2140951019 is an apocalyptic number.

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

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

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

The sum of its prime factors is 771.

The product of its (nonzero) digits is 1620, while the sum is 30.

The square root of 140951019 is about 11872.2794357276. The cubic root of 140951019 is about 520.4225104057.

It can be divided in two parts, 140 and 951019, that added together give a palindrome (951159).

The spelling of 140951019 in words is "one hundred forty million, nine hundred fifty-one thousand, nineteen".

Divisors: 1 3 11 33 37 111 241 407 479 723 1221 1437 2651 5269 7953 8917 15807 17723 26751 53169 98087 115439 194953 294261 346317 584859 1269829 3809487 4271243 12813729 46983673 140951019