Base | Representation |
---|---|
bin | 100000110100000000000110… |
… | …100100101000110000001111 |
3 | 200220221222221111210000012211 |
4 | 200310000012210220300033 |
5 | 122403342422410204012 |
6 | 1230531321411011251 |
7 | 42253061251503505 |
oct | 4064000644506017 |
9 | 626858844700184 |
10 | 144311011413007 |
11 | 41a88a5784273a |
12 | 14228535899b27 |
13 | 626a61572a11a |
14 | 278c993d70675 |
15 | 11a3cd96eb6a7 |
hex | 834006928c0f |
144311011413007 has 2 divisors, whose sum is σ = 144311011413008. Its totient is φ = 144311011413006.
The previous prime is 144311011412899. The next prime is 144311011413047. The reversal of 144311011413007 is 700314110113441.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144311011413007 is a prime.
It is a super-2 number, since 2×1443110114130072 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 144311011413007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144311011413047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72155505706503 + 72155505706504.
It is an arithmetic number, because the mean of its divisors is an integer number (72155505706504).
Almost surely, 2144311011413007 is an apocalyptic number.
144311011413007 is a deficient number, since it is larger than the sum of its proper divisors (1).
144311011413007 is an equidigital number, since it uses as much as digits as its factorization.
144311011413007 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 144311011413007 its reverse (700314110113441), we get a palindrome (844625121526448).
The spelling of 144311011413007 in words is "one hundred forty-four trillion, three hundred eleven billion, eleven million, four hundred thirteen thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •