Base | Representation |
---|---|
bin | 10000101101010… |
… | …01110111111101 |
3 | 100202201200110021 |
4 | 20112221313331 |
5 | 241340001123 |
6 | 21524012141 |
7 | 3321211165 |
oct | 1026516775 |
9 | 322650407 |
10 | 140156413 |
11 | 72129651 |
12 | 3ab31051 |
13 | 230635b7 |
14 | 148855a5 |
15 | c487c5d |
hex | 85a9dfd |
140156413 has 4 divisors (see below), whose sum is σ = 140263360. Its totient is φ = 140049468.
The previous prime is 140156339. The next prime is 140156417. The reversal of 140156413 is 314651041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 314651041 = 47 ⋅6694703.
It is a cyclic number.
It is not a de Polignac number, because 140156413 - 217 = 140025341 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 (140156417) 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 3 ways as a sum of consecutive naturals, for example, 51483 + ... + 54136.
It is an arithmetic number, because the mean of its divisors is an integer number (35065840).
Almost surely, 2140156413 is an apocalyptic number.
It is an amenable number.
140156413 is a deficient number, since it is larger than the sum of its proper divisors (106947).
140156413 is a wasteful number, since it uses less digits than its factorization.
140156413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106946.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 140156413 is about 11838.7673767162. The cubic root of 140156413 is about 519.4427128766.
The spelling of 140156413 in words is "one hundred forty million, one hundred fifty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •