Base | Representation |
---|---|
bin | 10000101110000… |
… | …00110000001111 |
3 | 100202220110000011 |
4 | 20113000300033 |
5 | 241401001002 |
6 | 21530014051 |
7 | 3322051333 |
oct | 1027006017 |
9 | 322813004 |
10 | 140250127 |
11 | 72192aa6 |
12 | 3ab77327 |
13 | 23097154 |
14 | 148ab7c3 |
15 | c4a58d7 |
hex | 85c0c0f |
140250127 has 2 divisors, whose sum is σ = 140250128. Its totient is φ = 140250126.
The previous prime is 140250083. The next prime is 140250161. The reversal of 140250127 is 721052041.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140250127 is a prime.
It is a super-2 number, since 2×1402501272 = 39340196247032258, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 140250098 and 140250107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140250167) 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 as a sum of consecutive naturals, namely, 70125063 + 70125064.
It is an arithmetic number, because the mean of its divisors is an integer number (70125064).
Almost surely, 2140250127 is an apocalyptic number.
140250127 is a deficient number, since it is larger than the sum of its proper divisors (1).
140250127 is an equidigital number, since it uses as much as digits as its factorization.
140250127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 140250127 is about 11842.7246442700. The cubic root of 140250127 is about 519.5584602473.
It can be divided in two parts, 1402 and 50127, that added together give a square (51529 = 2272).
The spelling of 140250127 in words is "one hundred forty million, two hundred fifty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •