Base | Representation |
---|---|
bin | 100000001110101001111110… |
… | …010000010010011101110101 |
3 | 200120212122122220022110210011 |
4 | 200032221332100102131311 |
5 | 122034320444444323444 |
6 | 1221244330015100221 |
7 | 41566466020210606 |
oct | 4016517620223565 |
9 | 616778586273704 |
10 | 141744628901749 |
11 | 41189617816205 |
12 | 13a93085511671 |
13 | 61125cc1c4b33 |
14 | 2700695ca7dad |
15 | 115c182d93734 |
hex | 80ea7e412775 |
141744628901749 has 2 divisors, whose sum is σ = 141744628901750. Its totient is φ = 141744628901748.
The previous prime is 141744628901741. The next prime is 141744628901753. The reversal of 141744628901749 is 947109826447141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94910110121124 + 46834518780625 = 9742182^2 + 6843575^2 .
It is a cyclic number.
It is not a de Polignac number, because 141744628901749 - 23 = 141744628901741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141744628901741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70872314450874 + 70872314450875.
It is an arithmetic number, because the mean of its divisors is an integer number (70872314450875).
Almost surely, 2141744628901749 is an apocalyptic number.
It is an amenable number.
141744628901749 is a deficient number, since it is larger than the sum of its proper divisors (1).
141744628901749 is an equidigital number, since it uses as much as digits as its factorization.
141744628901749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97542144, while the sum is 67.
The spelling of 141744628901749 in words is "one hundred forty-one trillion, seven hundred forty-four billion, six hundred twenty-eight million, nine hundred one thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •