Base | Representation |
---|---|
bin | 100000110111001100100100… |
… | …001010011011000000111001 |
3 | 200221201222121121121012002011 |
4 | 200313030210022123000321 |
5 | 122420442032101031221 |
6 | 1231220230230205521 |
7 | 42304662536015215 |
oct | 4067144412330071 |
9 | 627658547535064 |
10 | 144530551189561 |
11 | 420630762741a9 |
12 | 14262ba51b38a1 |
13 | 6285231c87a54 |
14 | 279945d177945 |
15 | 11a98882ce1e1 |
hex | 83732429b039 |
144530551189561 has 2 divisors, whose sum is σ = 144530551189562. Its totient is φ = 144530551189560.
The previous prime is 144530551189553. The next prime is 144530551189567. The reversal of 144530551189561 is 165981155035441.
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., 89787658653225 + 54742892536336 = 9475635^2 + 7398844^2 .
It is a cyclic number.
It is not a de Polignac number, because 144530551189561 - 23 = 144530551189553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144530551189496 and 144530551189505.
It is not a weakly prime, because it can be changed into another prime (144530551189567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72265275594780 + 72265275594781.
It is an arithmetic number, because the mean of its divisors is an integer number (72265275594781).
Almost surely, 2144530551189561 is an apocalyptic number.
It is an amenable number.
144530551189561 is a deficient number, since it is larger than the sum of its proper divisors (1).
144530551189561 is an equidigital number, since it uses as much as digits as its factorization.
144530551189561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960000, while the sum is 58.
The spelling of 144530551189561 in words is "one hundred forty-four trillion, five hundred thirty billion, five hundred fifty-one million, one hundred eighty-nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •