Base | Representation |
---|---|
bin | 11000110000010011011… |
… | …011110110001011000101 |
3 | 20000121220220002002021222 |
4 | 120300103123312023011 |
5 | 210332410034203401 |
6 | 3341253442250125 |
7 | 233621443623026 |
oct | 30602333661305 |
9 | 6017826062258 |
10 | 1701133116101 |
11 | 5a64a0328481 |
12 | 235836056945 |
13 | c455440c883 |
14 | 5c49a02ac4d |
15 | 2e3b5046c1b |
hex | 18c136f62c5 |
1701133116101 has 2 divisors, whose sum is σ = 1701133116102. Its totient is φ = 1701133116100.
The previous prime is 1701133116031. The next prime is 1701133116139. The reversal of 1701133116101 is 1016113311071.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 960929272900 + 740203843201 = 980270^2 + 860351^2 .
It is an emirp because it is prime and its reverse (1016113311071) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1701133116101 is a prime.
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 (1701133116161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 850566558050 + 850566558051.
It is an arithmetic number, because the mean of its divisors is an integer number (850566558051).
Almost surely, 21701133116101 is an apocalyptic number.
It is an amenable number.
1701133116101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1701133116101 is an equidigital number, since it uses as much as digits as its factorization.
1701133116101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 378, while the sum is 26.
Adding to 1701133116101 its reverse (1016113311071), we get a palindrome (2717246427172).
The spelling of 1701133116101 in words is "one trillion, seven hundred one billion, one hundred thirty-three million, one hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •