Base | Representation |
---|---|
bin | 100000001101001101100001… |
… | …101011100011010010000001 |
3 | 200120112011110001021002010122 |
4 | 200031031201223203102001 |
5 | 122031204202001331231 |
6 | 1221130552114510025 |
7 | 41556353124200426 |
oct | 4015154153432201 |
9 | 616464401232118 |
10 | 141645365261441 |
11 | 4115050a004038 |
12 | 13a779a2295315 |
13 | 61061401153b2 |
14 | 26d995a967d4d |
15 | 11597c360e77b |
hex | 80d361ae3481 |
141645365261441 has 2 divisors, whose sum is σ = 141645365261442. Its totient is φ = 141645365261440.
The previous prime is 141645365261371. The next prime is 141645365261531. The reversal of 141645365261441 is 144162563546141.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104097209462416 + 37548155799025 = 10202804^2 + 6127655^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141645365261441 is a prime.
It is not a weakly prime, because it can be changed into another prime (141645265261441) 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, 70822682630720 + 70822682630721.
It is an arithmetic number, because the mean of its divisors is an integer number (70822682630721).
Almost surely, 2141645365261441 is an apocalyptic number.
It is an amenable number.
141645365261441 is a deficient number, since it is larger than the sum of its proper divisors (1).
141645365261441 is an equidigital number, since it uses as much as digits as its factorization.
141645365261441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8294400, while the sum is 53.
The spelling of 141645365261441 in words is "one hundred forty-one trillion, six hundred forty-five billion, three hundred sixty-five million, two hundred sixty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •