Base | Representation |
---|---|
bin | 10001001100001… |
… | …01110101110001 |
3 | 101001100021111100 |
4 | 20212011311301 |
5 | 243403444441 |
6 | 22150435013 |
7 | 3400464156 |
oct | 1046056561 |
9 | 331307440 |
10 | 144203121 |
11 | 74442a37 |
12 | 40362a69 |
13 | 23b4c4ba |
14 | 1521a22d |
15 | c9d6cb6 |
hex | 8985d71 |
144203121 has 12 divisors (see below), whose sum is σ = 210804048. Its totient is φ = 94976664.
The previous prime is 144203117. The next prime is 144203131. The reversal of 144203121 is 121302441.
It is not a de Polignac number, because 144203121 - 22 = 144203117 is a prime.
It is a super-2 number, since 2×1442031212 = 41589080212281282, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 144203094 and 144203103.
It is not an unprimeable number, because it can be changed into a prime (144203131) 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 11 ways as a sum of consecutive naturals, for example, 95775 + ... + 97268.
It is an arithmetic number, because the mean of its divisors is an integer number (17567004).
Almost surely, 2144203121 is an apocalyptic number.
It is an amenable number.
144203121 is a deficient number, since it is larger than the sum of its proper divisors (66600927).
144203121 is a wasteful number, since it uses less digits than its factorization.
144203121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193132 (or 193129 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 144203121 is about 12008.4603925732. The cubic root of 144203121 is about 524.3946110246.
Adding to 144203121 its reverse (121302441), we get a palindrome (265505562).
The spelling of 144203121 in words is "one hundred forty-four million, two hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •