Base | Representation |
---|---|
bin | 1000001110111000010… |
… | …0100111111100000001 |
3 | 111112001201102002102002 |
4 | 2003232010213330001 |
5 | 4304123341034131 |
6 | 144550135033345 |
7 | 13134562610621 |
oct | 2035604477401 |
9 | 445051362362 |
10 | 141433143041 |
11 | 54a8835a783 |
12 | 234b180b855 |
13 | 1044c776228 |
14 | 6bb9aca881 |
15 | 3a2b9616cb |
hex | 20ee127f01 |
141433143041 has 2 divisors, whose sum is σ = 141433143042. Its totient is φ = 141433143040.
The previous prime is 141433143037. The next prime is 141433143053. The reversal of 141433143041 is 140341334141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114206823025 + 27226320016 = 337945^2 + 165004^2 .
It is a cyclic number.
It is not a de Polignac number, because 141433143041 - 22 = 141433143037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141433142995 and 141433143013.
It is not a weakly prime, because it can be changed into another prime (141433143941) 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, 70716571520 + 70716571521.
It is an arithmetic number, because the mean of its divisors is an integer number (70716571521).
Almost surely, 2141433143041 is an apocalyptic number.
It is an amenable number.
141433143041 is a deficient number, since it is larger than the sum of its proper divisors (1).
141433143041 is an equidigital number, since it uses as much as digits as its factorization.
141433143041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 141433143041 its reverse (140341334141), we get a palindrome (281774477182).
The spelling of 141433143041 in words is "one hundred forty-one billion, four hundred thirty-three million, one hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •