Base | Representation |
---|---|
bin | 11110110010111001011… |
… | …00010000100011001101 |
3 | 10202011011222221000020212 |
4 | 33121130230100203031 |
5 | 114314010431421223 |
6 | 2130031532452205 |
7 | 136306061422061 |
oct | 17313454204315 |
9 | 3664158830225 |
10 | 1058117060813 |
11 | 37882154a96a |
12 | 1510a131a065 |
13 | 78a1a8b6817 |
14 | 392dabd3aa1 |
15 | 1c7cda2b278 |
hex | f65cb108cd |
1058117060813 has 2 divisors, whose sum is σ = 1058117060814. Its totient is φ = 1058117060812.
The previous prime is 1058117060797. The next prime is 1058117060873. The reversal of 1058117060813 is 3180607118501.
1058117060813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 993805622404 + 64311438409 = 996898^2 + 253597^2 .
It is a cyclic number.
It is not a de Polignac number, because 1058117060813 - 24 = 1058117060797 is a prime.
It is a super-2 number, since 2×10581170608132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1058117060873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 529058530406 + 529058530407.
It is an arithmetic number, because the mean of its divisors is an integer number (529058530407).
Almost surely, 21058117060813 is an apocalyptic number.
It is an amenable number.
1058117060813 is a deficient number, since it is larger than the sum of its proper divisors (1).
1058117060813 is an equidigital number, since it uses as much as digits as its factorization.
1058117060813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40320, while the sum is 41.
The spelling of 1058117060813 in words is "one trillion, fifty-eight billion, one hundred seventeen million, sixty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •