Base | Representation |
---|---|
bin | 10000101001100100000… |
… | …100000111001110110011 |
3 | 11001101020002110012110221 |
4 | 100221210010013032303 |
5 | 122221144331204111 |
6 | 2233335525033511 |
7 | 145442600251201 |
oct | 20514404071663 |
9 | 4041202405427 |
10 | 1144140100531 |
11 | 40125529391a |
12 | 1658aa255897 |
13 | 83b797c325c |
14 | 3d53b858071 |
15 | 1eb65b84371 |
hex | 10a641073b3 |
1144140100531 has 2 divisors, whose sum is σ = 1144140100532. Its totient is φ = 1144140100530.
The previous prime is 1144140100423. The next prime is 1144140100541. The reversal of 1144140100531 is 1350010414411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1144140100531 - 213 = 1144140092339 is a prime.
It is a super-2 number, since 2×11441401005312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1144140100496 and 1144140100505.
It is not a weakly prime, because it can be changed into another prime (1144140100541) 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, 572070050265 + 572070050266.
It is an arithmetic number, because the mean of its divisors is an integer number (572070050266).
Almost surely, 21144140100531 is an apocalyptic number.
1144140100531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1144140100531 is an equidigital number, since it uses as much as digits as its factorization.
1144140100531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 1144140100531 its reverse (1350010414411), we get a palindrome (2494150514942).
The spelling of 1144140100531 in words is "one trillion, one hundred forty-four billion, one hundred forty million, one hundred thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •