Base | Representation |
---|---|
bin | 10001001110110… |
… | …00000111100101 |
3 | 101001222101210021 |
4 | 20213120013211 |
5 | 244000241013 |
6 | 22201555141 |
7 | 3403366543 |
oct | 1047300745 |
9 | 331871707 |
10 | 144540133 |
11 | 74653161 |
12 | 404a5ab1 |
13 | 23c39a0a |
14 | 152a6d93 |
15 | ca51a8d |
hex | 89d81e5 |
144540133 has 2 divisors, whose sum is σ = 144540134. Its totient is φ = 144540132.
The previous prime is 144540131. The next prime is 144540161. The reversal of 144540133 is 331045441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111154849 + 33385284 = 10543^2 + 5778^2 .
It is a cyclic number.
It is not a de Polignac number, because 144540133 - 21 = 144540131 is a prime.
Together with 144540131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 144540098 and 144540107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144540131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72270066 + 72270067.
It is an arithmetic number, because the mean of its divisors is an integer number (72270067).
Almost surely, 2144540133 is an apocalyptic number.
It is an amenable number.
144540133 is a deficient number, since it is larger than the sum of its proper divisors (1).
144540133 is an equidigital number, since it uses as much as digits as its factorization.
144540133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 144540133 is about 12022.4844770122. The cubic root of 144540133 is about 524.8028078781.
Adding to 144540133 its reverse (331045441), we get a palindrome (475585574).
The spelling of 144540133 in words is "one hundred forty-four million, five hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •