Base | Representation |
---|---|
bin | 11110111110101010010… |
… | …10001101000100110001 |
3 | 10202202111011202021200222 |
4 | 33133111022031010301 |
5 | 114414424341102423 |
6 | 2132554400222425 |
7 | 136621434304103 |
oct | 17372512150461 |
9 | 3682434667628 |
10 | 1064433144113 |
11 | 38047283a819 |
12 | 15236460aa15 |
13 | 794b62c1b11 |
14 | 397399a1573 |
15 | 1ca4d29d3c8 |
hex | f7d528d131 |
1064433144113 has 2 divisors, whose sum is σ = 1064433144114. Its totient is φ = 1064433144112.
The previous prime is 1064433144059. The next prime is 1064433144161. The reversal of 1064433144113 is 3114413344601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 571365156769 + 493067987344 = 755887^2 + 702188^2 .
It is a cyclic number.
It is not a de Polignac number, because 1064433144113 - 28 = 1064433143857 is a prime.
It is a super-2 number, since 2×10644331441132 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1064433143113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532216572056 + 532216572057.
It is an arithmetic number, because the mean of its divisors is an integer number (532216572057).
Almost surely, 21064433144113 is an apocalyptic number.
It is an amenable number.
1064433144113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1064433144113 is an equidigital number, since it uses as much as digits as its factorization.
1064433144113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 1064433144113 its reverse (3114413344601), we get a palindrome (4178846488714).
The spelling of 1064433144113 in words is "one trillion, sixty-four billion, four hundred thirty-three million, one hundred forty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •