Base | Representation |
---|---|
bin | 10111011111001111101011… |
… | …001000100101011000010101 |
3 | 111112202121001011110200221011 |
4 | 113133033223020211120111 |
5 | 102020000403023111432 |
6 | 1003412213240252221 |
7 | 30521223620266546 |
oct | 2737175310453025 |
9 | 445677034420834 |
10 | 103302203332117 |
11 | 2aa08244775189 |
12 | b7047aaa71071 |
13 | 458448210195a |
14 | 1b71bd37144cd |
15 | be21d9d4b847 |
hex | 5df3eb225615 |
103302203332117 has 2 divisors, whose sum is σ = 103302203332118. Its totient is φ = 103302203332116.
The previous prime is 103302203332021. The next prime is 103302203332127. The reversal of 103302203332117 is 711233302203301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66706406425201 + 36595796906916 = 8167399^2 + 6049446^2 .
It is a cyclic number.
It is not a de Polignac number, because 103302203332117 - 227 = 103302069114389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103302203332127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51651101666058 + 51651101666059.
It is an arithmetic number, because the mean of its divisors is an integer number (51651101666059).
Almost surely, 2103302203332117 is an apocalyptic number.
It is an amenable number.
103302203332117 is a deficient number, since it is larger than the sum of its proper divisors (1).
103302203332117 is an equidigital number, since it uses as much as digits as its factorization.
103302203332117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13608, while the sum is 31.
Adding to 103302203332117 its reverse (711233302203301), we get a palindrome (814535505535418).
The spelling of 103302203332117 in words is "one hundred three trillion, three hundred two billion, two hundred three million, three hundred thirty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •