Base | Representation |
---|---|
bin | 1000011001101100100… |
… | …0011111111001100001 |
3 | 111210120001210211222202 |
4 | 2012123020133321201 |
5 | 4331100133221212 |
6 | 150150214342545 |
7 | 13266540000503 |
oct | 2063310377141 |
9 | 453501724882 |
10 | 144336617057 |
11 | 56238291786 |
12 | 23b8205aa55 |
13 | 107c31622a9 |
14 | 6db3567d73 |
15 | 3b4b7da0c2 |
hex | 219b21fe61 |
144336617057 has 2 divisors, whose sum is σ = 144336617058. Its totient is φ = 144336617056.
The previous prime is 144336617021. The next prime is 144336617069. The reversal of 144336617057 is 750716633441.
144336617057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103226621521 + 41109995536 = 321289^2 + 202756^2 .
It is an emirp because it is prime and its reverse (750716633441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 144336617057 - 224 = 144319839841 is a prime.
It is not a weakly prime, because it can be changed into another prime (144336617077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72168308528 + 72168308529.
It is an arithmetic number, because the mean of its divisors is an integer number (72168308529).
Almost surely, 2144336617057 is an apocalyptic number.
It is an amenable number.
144336617057 is a deficient number, since it is larger than the sum of its proper divisors (1).
144336617057 is an equidigital number, since it uses as much as digits as its factorization.
144336617057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1270080, while the sum is 47.
The spelling of 144336617057 in words is "one hundred forty-four billion, three hundred thirty-six million, six hundred seventeen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •