Base | Representation |
---|---|
bin | 11110111000010001000… |
… | …10001011101010101001 |
3 | 10202102121220212121020022 |
4 | 33130020202023222221 |
5 | 114340412011204041 |
6 | 2131230002210225 |
7 | 136440400023464 |
oct | 17341042135251 |
9 | 3672556777208 |
10 | 1061000100521 |
11 | 379a70995309 |
12 | 151766953975 |
13 | 79089c9988a |
14 | 394d1a722db |
15 | 1c8ebbba24b |
hex | f70888baa9 |
1061000100521 has 2 divisors, whose sum is σ = 1061000100522. Its totient is φ = 1061000100520.
The previous prime is 1061000100487. The next prime is 1061000100617. The reversal of 1061000100521 is 1250010001601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1031567266921 + 29432833600 = 1015661^2 + 171560^2 .
It is a cyclic number.
It is not a de Polignac number, because 1061000100521 - 230 = 1059926358697 is a prime.
It is a super-2 number, since 2×10610001005212 (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 1061000100521.
It is not a weakly prime, because it can be changed into another prime (1061009100521) 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, 530500050260 + 530500050261.
It is an arithmetic number, because the mean of its divisors is an integer number (530500050261).
Almost surely, 21061000100521 is an apocalyptic number.
It is an amenable number.
1061000100521 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061000100521 is an equidigital number, since it uses as much as digits as its factorization.
1061000100521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
The spelling of 1061000100521 in words is "one trillion, sixty-one billion, one hundred thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •