Base | Representation |
---|---|
bin | 1000011001101000110… |
… | …0111011011101100001 |
3 | 111210111222102111012212 |
4 | 2012122030323131201 |
5 | 4331032134020223 |
6 | 150144455531505 |
7 | 13266260161526 |
oct | 2063214733541 |
9 | 453458374185 |
10 | 144321001313 |
11 | 5622a496405 |
12 | 23b78989b95 |
13 | 107bcb555c8 |
14 | 6db146114d |
15 | 3b4a253278 |
hex | 219a33b761 |
144321001313 has 2 divisors, whose sum is σ = 144321001314. Its totient is φ = 144321001312.
The previous prime is 144321001309. The next prime is 144321001393. The reversal of 144321001313 is 313100123441.
144321001313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79798905169 + 64522096144 = 282487^2 + 254012^2 .
It is a cyclic number.
It is not a de Polignac number, because 144321001313 - 22 = 144321001309 is a prime.
It is not a weakly prime, because it can be changed into another prime (144321001393) 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, 72160500656 + 72160500657.
It is an arithmetic number, because the mean of its divisors is an integer number (72160500657).
Almost surely, 2144321001313 is an apocalyptic number.
It is an amenable number.
144321001313 is a deficient number, since it is larger than the sum of its proper divisors (1).
144321001313 is an equidigital number, since it uses as much as digits as its factorization.
144321001313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 144321001313 its reverse (313100123441), we get a palindrome (457421124754).
The spelling of 144321001313 in words is "one hundred forty-four billion, three hundred twenty-one million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •