Base | Representation |
---|---|
bin | 100000000011111000100110… |
… | …011111111101110000111111 |
3 | 200111020220001121220002202122 |
4 | 200003320212133331300333 |
5 | 121440204024043210333 |
6 | 1215520312021313155 |
7 | 41462143013336033 |
oct | 4003704637756077 |
9 | 614226047802678 |
10 | 141004422241343 |
11 | 40a23704417551 |
12 | 139937278657bb |
13 | 608a876c2889b |
14 | 26b6916b9c1c3 |
15 | 1147cae0d1798 |
hex | 803e267fdc3f |
141004422241343 has 2 divisors, whose sum is σ = 141004422241344. Its totient is φ = 141004422241342.
The previous prime is 141004422241321. The next prime is 141004422241409. The reversal of 141004422241343 is 343142224400141.
It is a weak prime.
It is an emirp because it is prime and its reverse (343142224400141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141004422241343 - 26 = 141004422241279 is a prime.
It is a super-2 number, since 2×1410044222413432 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141004422201343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70502211120671 + 70502211120672.
It is an arithmetic number, because the mean of its divisors is an integer number (70502211120672).
Almost surely, 2141004422241343 is an apocalyptic number.
141004422241343 is a deficient number, since it is larger than the sum of its proper divisors (1).
141004422241343 is an equidigital number, since it uses as much as digits as its factorization.
141004422241343 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 141004422241343 its reverse (343142224400141), we get a palindrome (484146646641484).
The spelling of 141004422241343 in words is "one hundred forty-one trillion, four billion, four hundred twenty-two million, two hundred forty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •