Base | Representation |
---|---|
bin | 1000001101100000110… |
… | …0011111001110001111 |
3 | 111111010010202122220002 |
4 | 2003120030133032033 |
5 | 4302400410340433 |
6 | 144445504114515 |
7 | 13122515054213 |
oct | 2033014371617 |
9 | 444103678802 |
10 | 141066105743 |
11 | 5490a159172 |
12 | 2340a905a3b |
13 | 103c17062b4 |
14 | 6b83066943 |
15 | 3a0960e9e8 |
hex | 20d831f38f |
141066105743 has 2 divisors, whose sum is σ = 141066105744. Its totient is φ = 141066105742.
The previous prime is 141066105727. The next prime is 141066105751. The reversal of 141066105743 is 347501660141.
It is a happy number.
141066105743 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 141066105743 - 24 = 141066105727 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141066105697 and 141066105706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141066105793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70533052871 + 70533052872.
It is an arithmetic number, because the mean of its divisors is an integer number (70533052872).
Almost surely, 2141066105743 is an apocalyptic number.
141066105743 is a deficient number, since it is larger than the sum of its proper divisors (1).
141066105743 is an equidigital number, since it uses as much as digits as its factorization.
141066105743 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 38.
Adding to 141066105743 its reverse (347501660141), we get a palindrome (488567765884).
The spelling of 141066105743 in words is "one hundred forty-one billion, sixty-six million, one hundred five thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •