Base | Representation |
---|---|
bin | 1000011000011100100… |
… | …1011000001111011001 |
3 | 111202200200212011021121 |
4 | 2012013021120033121 |
5 | 4324403313203023 |
6 | 150053035405241 |
7 | 13255325612134 |
oct | 2060711301731 |
9 | 452620764247 |
10 | 144001303513 |
11 | 56085a88751 |
12 | 23aa98b3821 |
13 | 1076b84bb02 |
14 | 6d80c0121b |
15 | 3b2c152d5d |
hex | 21872583d9 |
144001303513 has 2 divisors, whose sum is σ = 144001303514. Its totient is φ = 144001303512.
The previous prime is 144001303499. The next prime is 144001303517. The reversal of 144001303513 is 315303100441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76426261209 + 67575042304 = 276453^2 + 259952^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144001303513 is a prime.
It is a super-2 number, since 2×1440013035132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (144001303517) 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, 72000651756 + 72000651757.
It is an arithmetic number, because the mean of its divisors is an integer number (72000651757).
Almost surely, 2144001303513 is an apocalyptic number.
It is an amenable number.
144001303513 is a deficient number, since it is larger than the sum of its proper divisors (1).
144001303513 is an equidigital number, since it uses as much as digits as its factorization.
144001303513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 144001303513 its reverse (315303100441), we get a palindrome (459304403954).
The spelling of 144001303513 in words is "one hundred forty-four billion, one million, three hundred three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •