Base | Representation |
---|---|
bin | 10000101101000… |
… | …10111110111111 |
3 | 100202200020202000 |
4 | 20112202332333 |
5 | 241333100231 |
6 | 21523233343 |
7 | 3321033000 |
oct | 1026427677 |
9 | 322606660 |
10 | 140128191 |
11 | 7210a425 |
12 | 3ab18853 |
13 | 230537b8 |
14 | 148791a7 |
15 | c47e6e6 |
hex | 85a2fbf |
140128191 has 32 divisors (see below), whose sum is σ = 242112000. Its totient is φ = 80067960.
The previous prime is 140128189. The next prime is 140128193. The reversal of 140128191 is 191821041.
It is an interprime number because it is at equal distance from previous prime (140128189) and next prime (140128193).
It is not a de Polignac number, because 140128191 - 21 = 140128189 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140128193) 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, 1696 + ... + 16826.
It is an arithmetic number, because the mean of its divisors is an integer number (7566000).
Almost surely, 2140128191 is an apocalyptic number.
140128191 is a deficient number, since it is larger than the sum of its proper divisors (101983809).
140128191 is an equidigital number, since it uses as much as digits as its factorization.
140128191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15161 (or 15141 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 27.
The square root of 140128191 is about 11837.5753851876. The cubic root of 140128191 is about 519.4078454120.
It can be divided in two parts, 1401 and 28191, that added together give a palindrome (29592).
The spelling of 140128191 in words is "one hundred forty million, one hundred twenty-eight thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •