Base | Representation |
---|---|
bin | 10001001110011… |
… | …10011001100001 |
3 | 101001220101011202 |
4 | 20213032121201 |
5 | 243443002241 |
6 | 22201050545 |
7 | 3403142510 |
oct | 1047163141 |
9 | 331811152 |
10 | 144500321 |
11 | 74626259 |
12 | 40486a55 |
13 | 23c24864 |
14 | 15296677 |
15 | ca44d9b |
hex | 89ce661 |
144500321 has 4 divisors (see below), whose sum is σ = 165143232. Its totient is φ = 123857412.
The previous prime is 144500303. The next prime is 144500341. The reversal of 144500321 is 123005441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 144500321 - 210 = 144499297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144500293 and 144500302.
It is not an unprimeable number, because it can be changed into a prime (144500341) 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 in 3 ways as a sum of consecutive naturals, for example, 10321445 + ... + 10321458.
It is an arithmetic number, because the mean of its divisors is an integer number (41285808).
Almost surely, 2144500321 is an apocalyptic number.
It is an amenable number.
144500321 is a deficient number, since it is larger than the sum of its proper divisors (20642911).
144500321 is an equidigital number, since it uses as much as digits as its factorization.
144500321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20642910.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 144500321 is about 12020.8286320037. The cubic root of 144500321 is about 524.7546197209.
Adding to 144500321 its reverse (123005441), we get a palindrome (267505762).
The spelling of 144500321 in words is "one hundred forty-four million, five hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •