Base | Representation |
---|---|
bin | 10000101101110… |
… | …10001000000101 |
3 | 100202212001202202 |
4 | 20112322020011 |
5 | 241344113411 |
6 | 21525244245 |
7 | 3321606233 |
oct | 1026721005 |
9 | 322761682 |
10 | 140222981 |
11 | 72174668 |
12 | 3ab63685 |
13 | 230879a2 |
14 | 148a1953 |
15 | c49c83b |
hex | 85ba205 |
140222981 has 2 divisors, whose sum is σ = 140222982. Its totient is φ = 140222980.
The previous prime is 140222969. The next prime is 140223011. The reversal of 140222981 is 189222041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115132900 + 25090081 = 10730^2 + 5009^2 .
It is a cyclic number.
It is not a de Polignac number, because 140222981 - 226 = 73114117 is a prime.
It is a super-2 number, since 2×1402229812 = 39324968801052722, which contains 22 as substring.
It is a Chen prime.
It is equal to p7924061 and since 140222981 and 7924061 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140222281) 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, 70111490 + 70111491.
It is an arithmetic number, because the mean of its divisors is an integer number (70111491).
Almost surely, 2140222981 is an apocalyptic number.
It is an amenable number.
140222981 is a deficient number, since it is larger than the sum of its proper divisors (1).
140222981 is an equidigital number, since it uses as much as digits as its factorization.
140222981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 29.
The square root of 140222981 is about 11841.5784843069. The cubic root of 140222981 is about 519.5249371784.
The spelling of 140222981 in words is "one hundred forty million, two hundred twenty-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •