Base | Representation |
---|---|
bin | 100000110010111110111111… |
… | …111000101100000110010101 |
3 | 200220201022111200102121201201 |
4 | 200302332333320230012111 |
5 | 122401221241114314032 |
6 | 1230435241015352501 |
7 | 42245035033415365 |
oct | 4062767770540625 |
9 | 626638450377651 |
10 | 144241106010517 |
11 | 41a61344a9212a |
12 | 14216a86682731 |
13 | 6263b54a84239 |
14 | 2789441b409a5 |
15 | 11a20975748e7 |
hex | 832fbfe2c195 |
144241106010517 has 2 divisors, whose sum is σ = 144241106010518. Its totient is φ = 144241106010516.
The previous prime is 144241106010509. The next prime is 144241106010523. The reversal of 144241106010517 is 715010601142441.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121580592796881 + 22660513213636 = 11026359^2 + 4760306^2 .
It is a cyclic number.
It is not a de Polignac number, because 144241106010517 - 23 = 144241106010509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144241106010557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72120553005258 + 72120553005259.
It is an arithmetic number, because the mean of its divisors is an integer number (72120553005259).
Almost surely, 2144241106010517 is an apocalyptic number.
It is an amenable number.
144241106010517 is a deficient number, since it is larger than the sum of its proper divisors (1).
144241106010517 is an equidigital number, since it uses as much as digits as its factorization.
144241106010517 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26880, while the sum is 37.
Adding to 144241106010517 its reverse (715010601142441), we get a palindrome (859251707152958).
The spelling of 144241106010517 in words is "one hundred forty-four trillion, two hundred forty-one billion, one hundred six million, ten thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •