Base | Representation |
---|---|
bin | 1000011001010000111… |
… | …1111101110111011101 |
3 | 111210021000111201102122 |
4 | 2012110033331313131 |
5 | 4330331102244201 |
6 | 150130531232325 |
7 | 13263635262206 |
oct | 2062417756735 |
9 | 453230451378 |
10 | 144221134301 |
11 | 56189085892 |
12 | 23b4b4486a5 |
13 | 107a525a4ba |
14 | 6da20a65ad |
15 | 3b415c7e1b |
hex | 21943fdddd |
144221134301 has 2 divisors, whose sum is σ = 144221134302. Its totient is φ = 144221134300.
The previous prime is 144221134289. The next prime is 144221134303. The reversal of 144221134301 is 103431122441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144160699225 + 60435076 = 379685^2 + 7774^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144221134301 is a prime.
Together with 144221134303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144221134303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72110567150 + 72110567151.
It is an arithmetic number, because the mean of its divisors is an integer number (72110567151).
Almost surely, 2144221134301 is an apocalyptic number.
It is an amenable number.
144221134301 is a deficient number, since it is larger than the sum of its proper divisors (1).
144221134301 is an equidigital number, since it uses as much as digits as its factorization.
144221134301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 144221134301 its reverse (103431122441), we get a palindrome (247652256742).
The spelling of 144221134301 in words is "one hundred forty-four billion, two hundred twenty-one million, one hundred thirty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •