Base | Representation |
---|---|
bin | 10001010010001… |
… | …00111000110001 |
3 | 101002211000220212 |
4 | 20221010320301 |
5 | 244104020044 |
6 | 22215313505 |
7 | 3410233454 |
oct | 1051047061 |
9 | 332730825 |
10 | 144985649 |
11 | 74927956 |
12 | 4067b895 |
13 | 24064733 |
14 | 1538149b |
15 | cadda9e |
hex | 8a44e31 |
144985649 has 2 divisors, whose sum is σ = 144985650. Its totient is φ = 144985648.
The previous prime is 144985627. The next prime is 144985651. The reversal of 144985649 is 946589441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121705024 + 23280625 = 11032^2 + 4825^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144985649 is a prime.
It is a Sophie Germain prime.
Together with 144985651, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 144985597 and 144985606.
It is not a weakly prime, because it can be changed into another prime (144985699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72492824 + 72492825.
It is an arithmetic number, because the mean of its divisors is an integer number (72492825).
Almost surely, 2144985649 is an apocalyptic number.
It is an amenable number.
144985649 is a deficient number, since it is larger than the sum of its proper divisors (1).
144985649 is an equidigital number, since it uses as much as digits as its factorization.
144985649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1244160, while the sum is 50.
The square root of 144985649 is about 12040.9986712066. The cubic root of 144985649 is about 525.3414546684.
The spelling of 144985649 in words is "one hundred forty-four million, nine hundred eighty-five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •