Base | Representation |
---|---|
bin | 10000101110010… |
… | …01101001101001 |
3 | 100202222021222212 |
4 | 20113021221221 |
5 | 241403132234 |
6 | 21530454505 |
7 | 3322262513 |
oct | 1027115151 |
9 | 322867885 |
10 | 140286569 |
11 | 72208415 |
12 | 3ab94435 |
13 | 230aa907 |
14 | 148babb3 |
15 | c4b15ce |
hex | 85c9a69 |
140286569 has 2 divisors, whose sum is σ = 140286570. Its totient is φ = 140286568.
The previous prime is 140286551. The next prime is 140286581. The reversal of 140286569 is 965682041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139546969 + 739600 = 11813^2 + 860^2 .
It is an emirp because it is prime and its reverse (965682041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140286569 - 28 = 140286313 is a prime.
It is a super-2 number, since 2×1402865692 = 39360642883583522, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (140286529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70143284 + 70143285.
It is an arithmetic number, because the mean of its divisors is an integer number (70143285).
Almost surely, 2140286569 is an apocalyptic number.
It is an amenable number.
140286569 is a deficient number, since it is larger than the sum of its proper divisors (1).
140286569 is an equidigital number, since it uses as much as digits as its factorization.
140286569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 41.
The square root of 140286569 is about 11844.2631260877. The cubic root of 140286569 is about 519.6034563082.
The spelling of 140286569 in words is "one hundred forty million, two hundred eighty-six thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •