Base | Representation |
---|---|
bin | 1000001011000100011… |
… | …1101101000001101101 |
3 | 111102102110012110221121 |
4 | 2002301013231001231 |
5 | 4300030044241031 |
6 | 144300445100541 |
7 | 13100334620224 |
oct | 2026107550155 |
9 | 442373173847 |
10 | 140410540141 |
11 | 546030a9013 |
12 | 23267257751 |
13 | 10318953c61 |
14 | 6b1dd77cbb |
15 | 39bbcb8011 |
hex | 20b11ed06d |
140410540141 has 2 divisors, whose sum is σ = 140410540142. Its totient is φ = 140410540140.
The previous prime is 140410540133. The next prime is 140410540181. The reversal of 140410540141 is 141045014041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140215798116 + 194742025 = 374454^2 + 13955^2 .
It is an emirp because it is prime and its reverse (141045014041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140410540141 - 23 = 140410540133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140410540181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70205270070 + 70205270071.
It is an arithmetic number, because the mean of its divisors is an integer number (70205270071).
Almost surely, 2140410540141 is an apocalyptic number.
It is an amenable number.
140410540141 is a deficient number, since it is larger than the sum of its proper divisors (1).
140410540141 is an equidigital number, since it uses as much as digits as its factorization.
140410540141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1280, while the sum is 25.
Adding to 140410540141 its reverse (141045014041), we get a palindrome (281455554182).
The spelling of 140410540141 in words is "one hundred forty billion, four hundred ten million, five hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •