Base | Representation |
---|---|
bin | 100000110101111001111000… |
… | …001110001010110000001101 |
3 | 200221102111110002202101111111 |
4 | 200311321320032022300031 |
5 | 122413013214342110321 |
6 | 1231111344244052021 |
7 | 42265400433050533 |
oct | 4065717016126015 |
9 | 627374402671444 |
10 | 144441767144461 |
11 | 42029455a67016 |
12 | 14249947694011 |
13 | 6279a53055117 |
14 | 2795039960153 |
15 | 11a73dda905e1 |
hex | 835e7838ac0d |
144441767144461 has 2 divisors, whose sum is σ = 144441767144462. Its totient is φ = 144441767144460.
The previous prime is 144441767144371. The next prime is 144441767144483. The reversal of 144441767144461 is 164441767144441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82742218875625 + 61699548268836 = 9096275^2 + 7854906^2 .
It is a cyclic number.
It is not a de Polignac number, because 144441767144461 - 233 = 144433177209869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144441767144396 and 144441767144405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144441767244461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72220883572230 + 72220883572231.
It is an arithmetic number, because the mean of its divisors is an integer number (72220883572231).
Almost surely, 2144441767144461 is an apocalyptic number.
It is an amenable number.
144441767144461 is a deficient number, since it is larger than the sum of its proper divisors (1).
144441767144461 is an equidigital number, since it uses as much as digits as its factorization.
144441767144461 is an evil number, because the sum of its binary digits is even.
The product of its digits is 28901376, while the sum is 58.
The spelling of 144441767144461 in words is "one hundred forty-four trillion, four hundred forty-one billion, seven hundred sixty-seven million, one hundred forty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •