Base | Representation |
---|---|
bin | 11110111000011000001… |
… | …11000100001101110001 |
3 | 10202102210002202221101102 |
4 | 33130030013010031301 |
5 | 114341022341212402 |
6 | 2131235544214145 |
7 | 136442026022102 |
oct | 17341407041561 |
9 | 3672702687342 |
10 | 1061060100977 |
11 | 379aa1846568 |
12 | 151782a6a355 |
13 | 79099546ac6 |
14 | 394d9a103a9 |
15 | 1c9020bd102 |
hex | f70c1c4371 |
1061060100977 has 2 divisors, whose sum is σ = 1061060100978. Its totient is φ = 1061060100976.
The previous prime is 1061060100931. The next prime is 1061060101009. The reversal of 1061060100977 is 7790010601601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 641150916961 + 419909184016 = 800719^2 + 648004^2 .
It is a cyclic number.
It is not a de Polignac number, because 1061060100977 - 232 = 1056765133681 is a prime.
It is a super-2 number, since 2×10610601009772 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1061060100977.
It is not a weakly prime, because it can be changed into another prime (1061060100277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530530050488 + 530530050489.
It is an arithmetic number, because the mean of its divisors is an integer number (530530050489).
Almost surely, 21061060100977 is an apocalyptic number.
It is an amenable number.
1061060100977 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061060100977 is an equidigital number, since it uses as much as digits as its factorization.
1061060100977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15876, while the sum is 38.
The spelling of 1061060100977 in words is "one trillion, sixty-one billion, sixty million, one hundred thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •