Base | Representation |
---|---|
bin | 11110111000011101101… |
… | …10001100101001101001 |
3 | 10202102220022011101201121 |
4 | 33130032312030221221 |
5 | 114341121114320404 |
6 | 2131244304215241 |
7 | 136443124162552 |
oct | 17341666145151 |
9 | 3672808141647 |
10 | 1061106010729 |
11 | 37a015753206 |
12 | 15179630a521 |
13 | 790a5bcc53b |
14 | 39501b61329 |
15 | 1c90613ae54 |
hex | f70ed8ca69 |
1061106010729 has 2 divisors, whose sum is σ = 1061106010730. Its totient is φ = 1061106010728.
The previous prime is 1061106010711. The next prime is 1061106010771. The reversal of 1061106010729 is 9270106011601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1061106010000 + 729 = 1030100^2 + 27^2 .
It is an emirp because it is prime and its reverse (9270106011601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1061106010729 - 25 = 1061106010697 is a prime.
It is a super-2 number, since 2×10611060107292 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1061106010694 and 1061106010703.
It is not a weakly prime, because it can be changed into another prime (1061106010709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530553005364 + 530553005365.
It is an arithmetic number, because the mean of its divisors is an integer number (530553005365).
Almost surely, 21061106010729 is an apocalyptic number.
It is an amenable number.
1061106010729 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061106010729 is an equidigital number, since it uses as much as digits as its factorization.
1061106010729 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 34.
The spelling of 1061106010729 in words is "one trillion, sixty-one billion, one hundred six million, ten thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •