Base | Representation |
---|---|
bin | 11110110010110101101… |
… | …01111110011010110001 |
3 | 10202011002211120200021211 |
4 | 33121122311332122301 |
5 | 114313430012203203 |
6 | 2130024504120121 |
7 | 136305234026644 |
oct | 17313265763261 |
9 | 3664084520254 |
10 | 1058086053553 |
11 | 378805aa1731 |
12 | 151092a66041 |
13 | 78a1434b229 |
14 | 392d6a41a5b |
15 | 1c7cae53c6d |
hex | f65ad7e6b1 |
1058086053553 has 2 divisors, whose sum is σ = 1058086053554. Its totient is φ = 1058086053552.
The previous prime is 1058086053529. The next prime is 1058086053569. The reversal of 1058086053553 is 3553506808501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 930592067584 + 127493985969 = 964672^2 + 357063^2 .
It is a cyclic number.
It is not a de Polignac number, because 1058086053553 - 29 = 1058086053041 is a prime.
It is a super-3 number, since 3×10580860535533 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1058086053497 and 1058086053506.
It is not a weakly prime, because it can be changed into another prime (1058086083553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 529043026776 + 529043026777.
It is an arithmetic number, because the mean of its divisors is an integer number (529043026777).
Almost surely, 21058086053553 is an apocalyptic number.
It is an amenable number.
1058086053553 is a deficient number, since it is larger than the sum of its proper divisors (1).
1058086053553 is an equidigital number, since it uses as much as digits as its factorization.
1058086053553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160000, while the sum is 49.
The spelling of 1058086053553 in words is "one trillion, fifty-eight billion, eighty-six million, fifty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •