Base | Representation |
---|---|
bin | 1000011001111111000… |
… | …0111011010100100001 |
3 | 111210202111000202212201 |
4 | 2012133300323110201 |
5 | 4331230031332001 |
6 | 150202032053201 |
7 | 13301502333403 |
oct | 2063760732441 |
9 | 453674022781 |
10 | 144414324001 |
11 | 562781370a2 |
12 | 23ba4094201 |
13 | 1080629ba2c |
14 | 6dbd9d4b73 |
15 | 3b53539501 |
hex | 219fc3b521 |
144414324001 has 2 divisors, whose sum is σ = 144414324002. Its totient is φ = 144414324000.
The previous prime is 144414323959. The next prime is 144414324031. The reversal of 144414324001 is 100423414441.
144414324001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125440638976 + 18973685025 = 354176^2 + 137745^2 .
It is a cyclic number.
It is not a de Polignac number, because 144414324001 - 29 = 144414323489 is a prime.
It is not a weakly prime, because it can be changed into another prime (144414324031) 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, 72207162000 + 72207162001.
It is an arithmetic number, because the mean of its divisors is an integer number (72207162001).
Almost surely, 2144414324001 is an apocalyptic number.
It is an amenable number.
144414324001 is a deficient number, since it is larger than the sum of its proper divisors (1).
144414324001 is an equidigital number, since it uses as much as digits as its factorization.
144414324001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 144414324001 its reverse (100423414441), we get a palindrome (244837738442).
The spelling of 144414324001 in words is "one hundred forty-four billion, four hundred fourteen million, three hundred twenty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •