Base | Representation |
---|---|
bin | 1000011001100110101… |
… | …1110100010010110011 |
3 | 111210111101002111100022 |
4 | 2012121223310102303 |
5 | 4331022423234303 |
6 | 150143545514055 |
7 | 13266123330221 |
oct | 2063153642263 |
9 | 453441074308 |
10 | 144312321203 |
11 | 562255a7966 |
12 | 23b75aa292b |
13 | 107bb10674b |
14 | 6db0241b11 |
15 | 3b495db438 |
hex | 2199af44b3 |
144312321203 has 2 divisors, whose sum is σ = 144312321204. Its totient is φ = 144312321202.
The previous prime is 144312321187. The next prime is 144312321229. The reversal of 144312321203 is 302123213441.
144312321203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (144312321229) can be obtained adding 144312321203 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 144312321203 - 24 = 144312321187 is a prime.
It is not a weakly prime, because it can be changed into another prime (144312321253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72156160601 + 72156160602.
It is an arithmetic number, because the mean of its divisors is an integer number (72156160602).
Almost surely, 2144312321203 is an apocalyptic number.
144312321203 is a deficient number, since it is larger than the sum of its proper divisors (1).
144312321203 is an equidigital number, since it uses as much as digits as its factorization.
144312321203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 144312321203 its reverse (302123213441), we get a palindrome (446435534644).
The spelling of 144312321203 in words is "one hundred forty-four billion, three hundred twelve million, three hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •