Base | Representation |
---|---|
bin | 1000001100011101111… |
… | …1111110000100001101 |
3 | 111110101121200211020112 |
4 | 2003013133332010031 |
5 | 4301312204001031 |
6 | 144402020325405 |
7 | 13112544153623 |
oct | 2030737760415 |
9 | 443347624215 |
10 | 140786000141 |
11 | 54786032736 |
12 | 23350b43865 |
13 | 10378682837 |
14 | 6b57b91513 |
15 | 39dec3062b |
hex | 20c77fe10d |
140786000141 has 2 divisors, whose sum is σ = 140786000142. Its totient is φ = 140786000140.
The previous prime is 140786000137. The next prime is 140786000171. The reversal of 140786000141 is 141000687041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97762528900 + 43023471241 = 312670^2 + 207421^2 .
It is an emirp because it is prime and its reverse (141000687041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140786000141 - 22 = 140786000137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140786000098 and 140786000107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140786000171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70393000070 + 70393000071.
It is an arithmetic number, because the mean of its divisors is an integer number (70393000071).
Almost surely, 2140786000141 is an apocalyptic number.
It is an amenable number.
140786000141 is a deficient number, since it is larger than the sum of its proper divisors (1).
140786000141 is an equidigital number, since it uses as much as digits as its factorization.
140786000141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5376, while the sum is 32.
Adding to 140786000141 its reverse (141000687041), we get a palindrome (281786687182).
The spelling of 140786000141 in words is "one hundred forty billion, seven hundred eighty-six million, one hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •