Base | Representation |
---|---|
bin | 10001001100010… |
… | …10111111101001 |
3 | 101001101100110021 |
4 | 20212022333221 |
5 | 243410133413 |
6 | 22151120441 |
7 | 3400612546 |
oct | 1046127751 |
9 | 331340407 |
10 | 144224233 |
11 | 7445788a |
12 | 40373121 |
13 | 23b58caa |
14 | 15223bcd |
15 | c9dd18d |
hex | 898afe9 |
144224233 has 4 divisors (see below), whose sum is σ = 145844820. Its totient is φ = 142603648.
The previous prime is 144224207. The next prime is 144224299. The reversal of 144224233 is 332422441.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 87553449 + 56670784 = 9357^2 + 7528^2 .
It is a cyclic number.
It is not a de Polignac number, because 144224233 - 29 = 144223721 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144224198 and 144224207.
It is not an unprimeable number, because it can be changed into a prime (144224033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 810160 + ... + 810337.
It is an arithmetic number, because the mean of its divisors is an integer number (36461205).
Almost surely, 2144224233 is an apocalyptic number.
It is an amenable number.
144224233 is a deficient number, since it is larger than the sum of its proper divisors (1620587).
144224233 is an equidigital number, since it uses as much as digits as its factorization.
144224233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1620586.
The product of its digits is 4608, while the sum is 25.
The square root of 144224233 is about 12009.3394073113. The cubic root of 144224233 is about 524.4202010366.
Adding to 144224233 its reverse (332422441), we get a palindrome (476646674).
The spelling of 144224233 in words is "one hundred forty-four million, two hundred twenty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •