Base | Representation |
---|---|
bin | 101111100011110011… |
… | …1101010001101101101 |
3 | 100202121211211201211221 |
4 | 1133013213222031231 |
5 | 3133132111412232 |
6 | 114530331143341 |
7 | 10243646546053 |
oct | 1370747521555 |
9 | 322554751757 |
10 | 102133310317 |
11 | 3a350655785 |
12 | 179642a4b51 |
13 | 982879123c |
14 | 4d2c4dc1d3 |
15 | 29cb681897 |
hex | 17c79ea36d |
102133310317 has 2 divisors, whose sum is σ = 102133310318. Its totient is φ = 102133310316.
The previous prime is 102133310287. The next prime is 102133310341. The reversal of 102133310317 is 713013331201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101825448201 + 307862116 = 319101^2 + 17546^2 .
It is a cyclic number.
It is not a de Polignac number, because 102133310317 - 215 = 102133277549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102133310291 and 102133310300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102133310347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51066655158 + 51066655159.
It is an arithmetic number, because the mean of its divisors is an integer number (51066655159).
Almost surely, 2102133310317 is an apocalyptic number.
It is an amenable number.
102133310317 is a deficient number, since it is larger than the sum of its proper divisors (1).
102133310317 is an equidigital number, since it uses as much as digits as its factorization.
102133310317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 102133310317 its reverse (713013331201), we get a palindrome (815146641518).
The spelling of 102133310317 in words is "one hundred two billion, one hundred thirty-three million, three hundred ten thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •