Base | Representation |
---|---|
bin | 10000101101001… |
… | …01101010001111 |
3 | 100202200210202221 |
4 | 20112211222033 |
5 | 241333423101 |
6 | 21523400211 |
7 | 3321106645 |
oct | 1026455217 |
9 | 322623687 |
10 | 140139151 |
11 | 72117689 |
12 | 3ab23067 |
13 | 23058799 |
14 | 1487d195 |
15 | c482aa1 |
hex | 85a5a8f |
140139151 has 4 divisors (see below), whose sum is σ = 140463232. Its totient is φ = 139815072.
The previous prime is 140139137. The next prime is 140139157. The reversal of 140139151 is 151931041.
140139151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151931041 = 2687 ⋅56543.
It is a cyclic number.
It is not a de Polignac number, because 140139151 - 29 = 140138639 is a prime.
It is a super-3 number, since 3×1401391513 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140139157) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 161391 + ... + 162256.
It is an arithmetic number, because the mean of its divisors is an integer number (35115808).
Almost surely, 2140139151 is an apocalyptic number.
140139151 is a deficient number, since it is larger than the sum of its proper divisors (324081).
140139151 is an equidigital number, since it uses as much as digits as its factorization.
140139151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324080.
The product of its (nonzero) digits is 540, while the sum is 25.
The square root of 140139151 is about 11838.0383087740. The cubic root of 140139151 is about 519.4213867309.
The spelling of 140139151 in words is "one hundred forty million, one hundred thirty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •