Base | Representation |
---|---|
bin | 10101000001000111101… |
… | …010110000111001100011 |
3 | 12010002000112201100120211 |
4 | 111001013222300321203 |
5 | 142130422204413011 |
6 | 3023301341514551 |
7 | 206230245242131 |
oct | 25010752607143 |
9 | 5102015640524 |
10 | 1444311404131 |
11 | 507590153042 |
12 | 1b3b00b72a57 |
13 | a6275c6c62b |
14 | 4dc9562c751 |
15 | 278833ceb21 |
hex | 15047ab0e63 |
1444311404131 has 2 divisors, whose sum is σ = 1444311404132. Its totient is φ = 1444311404130.
The previous prime is 1444311404111. The next prime is 1444311404141. The reversal of 1444311404131 is 1314041134441.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1444311404131 - 235 = 1409951665763 is a prime.
It is a super-2 number, since 2×14443114041312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1444311404093 and 1444311404102.
It is not a weakly prime, because it can be changed into another prime (1444311404111) 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, 722155702065 + 722155702066.
It is an arithmetic number, because the mean of its divisors is an integer number (722155702066).
Almost surely, 21444311404131 is an apocalyptic number.
1444311404131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1444311404131 is an equidigital number, since it uses as much as digits as its factorization.
1444311404131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 1444311404131 its reverse (1314041134441), we get a palindrome (2758352538572).
The spelling of 1444311404131 in words is "one trillion, four hundred forty-four billion, three hundred eleven million, four hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •