Base | Representation |
---|---|
bin | 10111001101111010010010… |
… | …000100101111110011011001 |
3 | 111101112201100101021212011112 |
4 | 113031322102010233303121 |
5 | 101340441313310304032 |
6 | 1001101051451510105 |
7 | 30336163564323131 |
oct | 2715722204576331 |
9 | 441481311255145 |
10 | 102111003213017 |
11 | 2a599040315937 |
12 | b551968458335 |
13 | 44c904599a986 |
14 | 1b302adbcbac1 |
15 | bc121c9ad1b2 |
hex | 5cde9212fcd9 |
102111003213017 has 2 divisors, whose sum is σ = 102111003213018. Its totient is φ = 102111003213016.
The previous prime is 102111003212987. The next prime is 102111003213059. The reversal of 102111003213017 is 710312300111201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99580520832016 + 2530482381001 = 9979004^2 + 1590749^2 .
It is a cyclic number.
It is not a de Polignac number, because 102111003213017 - 214 = 102111003196633 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102111003212983 and 102111003213001.
It is not a weakly prime, because it can be changed into another prime (102111003212017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51055501606508 + 51055501606509.
It is an arithmetic number, because the mean of its divisors is an integer number (51055501606509).
Almost surely, 2102111003213017 is an apocalyptic number.
It is an amenable number.
102111003213017 is a deficient number, since it is larger than the sum of its proper divisors (1).
102111003213017 is an equidigital number, since it uses as much as digits as its factorization.
102111003213017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 102111003213017 its reverse (710312300111201), we get a palindrome (812423303324218).
The spelling of 102111003213017 in words is "one hundred two trillion, one hundred eleven billion, three million, two hundred thirteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •