Base | Representation |
---|---|
bin | 10001001010111… |
… | …10110011011111 |
3 | 101001001011011111 |
4 | 20211132303133 |
5 | 243333340411 |
6 | 22143202451 |
7 | 3366230053 |
oct | 1045366337 |
9 | 331034144 |
10 | 144043231 |
11 | 743438a2 |
12 | 402a6427 |
13 | 23ac47a7 |
14 | 151b7c63 |
15 | c9a4721 |
hex | 895ecdf |
144043231 has 2 divisors, whose sum is σ = 144043232. Its totient is φ = 144043230.
The previous prime is 144043219. The next prime is 144043253. The reversal of 144043231 is 132340441.
It is an a-pointer prime, because the next prime (144043253) can be obtained adding 144043231 to its sum of digits (22).
It is a weak prime.
It is an emirp because it is prime and its reverse (132340441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 144043231 - 217 = 143912159 is a prime.
It is a super-2 number, since 2×1440432312 = 41496904793838722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144043931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72021615 + 72021616.
It is an arithmetic number, because the mean of its divisors is an integer number (72021616).
Almost surely, 2144043231 is an apocalyptic number.
144043231 is a deficient number, since it is larger than the sum of its proper divisors (1).
144043231 is an equidigital number, since it uses as much as digits as its factorization.
144043231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 144043231 is about 12001.8011564931. The cubic root of 144043231 is about 524.2007260340.
Adding to 144043231 its reverse (132340441), we get a palindrome (276383672).
The spelling of 144043231 in words is "one hundred forty-four million, forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •