Base | Representation |
---|---|
bin | 11110111110001001111… |
… | …10000101000100001101 |
3 | 10202201210020122212100122 |
4 | 33133010332011010031 |
5 | 114413400322431000 |
6 | 2132511414434325 |
7 | 136611625521431 |
oct | 17370476050415 |
9 | 3681706585318 |
10 | 1064161530125 |
11 | 380343494151 |
12 | 1522a96629a5 |
13 | 79471c52495 |
14 | 3971189a9c1 |
15 | 1ca344ea085 |
hex | f7c4f8510d |
1064161530125 has 32 divisors (see below), whose sum is σ = 1343271327840. Its totient is φ = 841591027200.
The previous prime is 1064161530067. The next prime is 1064161530143. The reversal of 1064161530125 is 5210351614601.
It can be written as a sum of positive squares in 16 ways, for example, as 558216685321 + 505944844804 = 747139^2 + 711298^2 .
It is not a de Polignac number, because 1064161530125 - 228 = 1063893094669 is a prime.
It is a super-2 number, since 2×10641615301252 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100264319 + ... + 100274931.
It is an arithmetic number, because the mean of its divisors is an integer number (41977228995).
Almost surely, 21064161530125 is an apocalyptic number.
It is an amenable number.
1064161530125 is a deficient number, since it is larger than the sum of its proper divisors (279109797715).
1064161530125 is an equidigital number, since it uses as much as digits as its factorization.
1064161530125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19730 (or 19720 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 1064161530125 in words is "one trillion, sixty-four billion, one hundred sixty-one million, five hundred thirty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •