Base | Representation |
---|---|
bin | 11110111110001001111… |
… | …10000101000100011111 |
3 | 10202201210020122212101022 |
4 | 33133010332011010133 |
5 | 114413400322431033 |
6 | 2132511414434355 |
7 | 136611625521455 |
oct | 17370476050437 |
9 | 3681706585338 |
10 | 1064161530143 |
11 | 380343494168 |
12 | 1522a96629bb |
13 | 79471c524aa |
14 | 3971189a9d5 |
15 | 1ca344ea098 |
hex | f7c4f8511f |
1064161530143 has 2 divisors, whose sum is σ = 1064161530144. Its totient is φ = 1064161530142.
The previous prime is 1064161530067. The next prime is 1064161530149. The reversal of 1064161530143 is 3410351614601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1064161530143 - 212 = 1064161526047 is a prime.
It is a super-2 number, since 2×10641615301432 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1064161530149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532080765071 + 532080765072.
It is an arithmetic number, because the mean of its divisors is an integer number (532080765072).
Almost surely, 21064161530143 is an apocalyptic number.
1064161530143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1064161530143 is an equidigital number, since it uses as much as digits as its factorization.
1064161530143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 1064161530143 in words is "one trillion, sixty-four billion, one hundred sixty-one million, five hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •