Base | Representation |
---|---|
bin | 100000000101110111110011… |
… | …011011101010111011000011 |
3 | 200111201221121021101020012011 |
4 | 200011313303123222323003 |
5 | 121444423234113243133 |
6 | 1220103140551513351 |
7 | 41505046443651601 |
oct | 4005676333527303 |
9 | 614657537336164 |
10 | 141141004431043 |
11 | 40a76622510181 |
12 | 139b60a4988857 |
13 | 609a70269a206 |
14 | 26bd392504871 |
15 | 114b604c2d6cd |
hex | 805df36eaec3 |
141141004431043 has 2 divisors, whose sum is σ = 141141004431044. Its totient is φ = 141141004431042.
The previous prime is 141141004430981. The next prime is 141141004431061. The reversal of 141141004431043 is 340134400141141.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (340134400141141) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141141004431043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141141004430996 and 141141004431014.
It is not a weakly prime, because it can be changed into another prime (141141004441043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70570502215521 + 70570502215522.
It is an arithmetic number, because the mean of its divisors is an integer number (70570502215522).
Almost surely, 2141141004431043 is an apocalyptic number.
141141004431043 is a deficient number, since it is larger than the sum of its proper divisors (1).
141141004431043 is an equidigital number, since it uses as much as digits as its factorization.
141141004431043 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 141141004431043 its reverse (340134400141141), we get a palindrome (481275404572184).
The spelling of 141141004431043 in words is "one hundred forty-one trillion, one hundred forty-one billion, four million, four hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •