Base | Representation |
---|---|
bin | 10000101001111111100… |
… | …110001101110001000111 |
3 | 11001102102021122101202202 |
4 | 100221333212031301013 |
5 | 122223121104300111 |
6 | 2233453425425115 |
7 | 145460206453643 |
oct | 20517746156107 |
9 | 4042367571682 |
10 | 1144602025031 |
11 | 401472004603 |
12 | 1659b8a9b19b |
13 | 83c2140676a |
14 | 3d582d3bc23 |
15 | 1eb914cab3b |
hex | 10a7f98dc47 |
1144602025031 has 2 divisors, whose sum is σ = 1144602025032. Its totient is φ = 1144602025030.
The previous prime is 1144602025013. The next prime is 1144602025067. The reversal of 1144602025031 is 1305202064411.
Together with previous prime (1144602025013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1144602025031 - 214 = 1144602008647 is a prime.
It is a super-2 number, since 2×11446020250312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1144602024985 and 1144602025003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1144602025531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572301012515 + 572301012516.
It is an arithmetic number, because the mean of its divisors is an integer number (572301012516).
Almost surely, 21144602025031 is an apocalyptic number.
1144602025031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1144602025031 is an equidigital number, since it uses as much as digits as its factorization.
1144602025031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 1144602025031 its reverse (1305202064411), we get a palindrome (2449804089442).
The spelling of 1144602025031 in words is "one trillion, one hundred forty-four billion, six hundred two million, twenty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •