Base | Representation |
---|---|
bin | 10001001101011… |
… | …11001001000101 |
3 | 101001122212112222 |
4 | 20212233021011 |
5 | 243424403133 |
6 | 22154222125 |
7 | 3402100322 |
oct | 1046571105 |
9 | 331585488 |
10 | 144372293 |
11 | 7454904a |
12 | 40424945 |
13 | 23bab4c0 |
14 | 15261b49 |
15 | ca1be98 |
hex | 89af245 |
144372293 has 8 divisors (see below), whose sum is σ = 155883000. Its totient is φ = 132919488.
The previous prime is 144372289. The next prime is 144372331. The reversal of 144372293 is 392273441.
It can be written as a sum of positive squares in 4 ways, for example, as 1760929 + 142611364 = 1327^2 + 11942^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144372293 - 22 = 144372289 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144372223) 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 7 ways as a sum of consecutive naturals, for example, 9218 + ... + 19331.
It is an arithmetic number, because the mean of its divisors is an integer number (19485375).
Almost surely, 2144372293 is an apocalyptic number.
144372293 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
144372293 is a deficient number, since it is larger than the sum of its proper divisors (11510707).
144372293 is a wasteful number, since it uses less digits than its factorization.
144372293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28951.
The product of its digits is 36288, while the sum is 35.
The square root of 144372293 is about 12015.5021950812. The cubic root of 144372293 is about 524.5995955305.
The spelling of 144372293 in words is "one hundred forty-four million, three hundred seventy-two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •