Base | Representation |
---|---|
bin | 101111100011011010… |
… | …1101100001001000101 |
3 | 100202120221012012222112 |
4 | 1133012311230021011 |
5 | 3133120233223023 |
6 | 114525142310405 |
7 | 10243430320502 |
oct | 1370665541105 |
9 | 322527165875 |
10 | 102120211013 |
11 | 3a344219007 |
12 | 1795ba28405 |
13 | 9825b55a82 |
14 | 4d2a88c4a9 |
15 | 29ca445478 |
hex | 17c6d6c245 |
102120211013 has 2 divisors, whose sum is σ = 102120211014. Its totient is φ = 102120211012.
The previous prime is 102120210991. The next prime is 102120211019. The reversal of 102120211013 is 310112021201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101491304929 + 628906084 = 318577^2 + 25078^2 .
It is an emirp because it is prime and its reverse (310112021201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102120211013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102120211019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51060105506 + 51060105507.
It is an arithmetic number, because the mean of its divisors is an integer number (51060105507).
Almost surely, 2102120211013 is an apocalyptic number.
It is an amenable number.
102120211013 is a deficient number, since it is larger than the sum of its proper divisors (1).
102120211013 is an equidigital number, since it uses as much as digits as its factorization.
102120211013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 102120211013 its reverse (310112021201), we get a palindrome (412232232214).
The spelling of 102120211013 in words is "one hundred two billion, one hundred twenty million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •