Base | Representation |
---|---|
bin | 100000111100100101110010… |
… | …101110010111000100001101 |
3 | 201000001102102022021000100111 |
4 | 200330211302232113010031 |
5 | 122443030213010432002 |
6 | 1232102413053200021 |
7 | 42343524501341266 |
oct | 4074456256270415 |
9 | 630042368230314 |
10 | 144901236420877 |
11 | 421962a6434a42 |
12 | 143029b6a90011 |
13 | 62b118819c101 |
14 | 27ad385d0396d |
15 | 11b43313053d7 |
hex | 83c972b9710d |
144901236420877 has 2 divisors, whose sum is σ = 144901236420878. Its totient is φ = 144901236420876.
The previous prime is 144901236420839. The next prime is 144901236420887. The reversal of 144901236420877 is 778024632109441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133546082013796 + 11355154407081 = 11556214^2 + 3369741^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144901236420877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144901236420887) 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, 72450618210438 + 72450618210439.
It is an arithmetic number, because the mean of its divisors is an integer number (72450618210439).
Almost surely, 2144901236420877 is an apocalyptic number.
It is an amenable number.
144901236420877 is a deficient number, since it is larger than the sum of its proper divisors (1).
144901236420877 is an equidigital number, since it uses as much as digits as its factorization.
144901236420877 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16257024, while the sum is 58.
The spelling of 144901236420877 in words is "one hundred forty-four trillion, nine hundred one billion, two hundred thirty-six million, four hundred twenty thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •