Base | Representation |
---|---|
bin | 10111111000110000001001… |
… | …000000111110101001010101 |
3 | 111202222011110011012001022022 |
4 | 113320300021000332221111 |
5 | 102232210221113433301 |
6 | 1011233342503542525 |
7 | 31061656051264421 |
oct | 2770601100765125 |
9 | 452864404161268 |
10 | 105055051311701 |
11 | 3052366275aa57 |
12 | b94845815aa45 |
13 | 4680858632c5a |
14 | 1bd2997b05b81 |
15 | c22aca075d1b |
hex | 5f8c0903ea55 |
105055051311701 has 2 divisors, whose sum is σ = 105055051311702. Its totient is φ = 105055051311700.
The previous prime is 105055051311677. The next prime is 105055051311787. The reversal of 105055051311701 is 107113150550501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83065469928676 + 21989581383025 = 9114026^2 + 4689305^2 .
It is a cyclic number.
It is not a de Polignac number, because 105055051311701 - 214 = 105055051295317 is a prime.
It is a super-2 number, since 2×1050550513117012 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105055051311601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52527525655850 + 52527525655851.
It is an arithmetic number, because the mean of its divisors is an integer number (52527525655851).
Almost surely, 2105055051311701 is an apocalyptic number.
It is an amenable number.
105055051311701 is a deficient number, since it is larger than the sum of its proper divisors (1).
105055051311701 is an equidigital number, since it uses as much as digits as its factorization.
105055051311701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13125, while the sum is 35.
The spelling of 105055051311701 in words is "one hundred five trillion, fifty-five billion, fifty-one million, three hundred eleven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •