Base | Representation |
---|---|
bin | 101111100011011001… |
… | …1101001101111110001 |
3 | 100202120220012002100001 |
4 | 1133012303221233301 |
5 | 3133120114130123 |
6 | 114525123030001 |
7 | 10243422634402 |
oct | 1370663515761 |
9 | 322526162301 |
10 | 102119676913 |
11 | 3a343993801 |
12 | 1795b80b301 |
13 | 98259c9937 |
14 | 4d2a78d9a9 |
15 | 29ca38c0ad |
hex | 17c6ce9bf1 |
102119676913 has 2 divisors, whose sum is σ = 102119676914. Its totient is φ = 102119676912.
The previous prime is 102119676887. The next prime is 102119676929. The reversal of 102119676913 is 319676911201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88225632784 + 13894044129 = 297028^2 + 117873^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102119676913 is a prime.
It is not a weakly prime, because it can be changed into another prime (102119676313) 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, 51059838456 + 51059838457.
It is an arithmetic number, because the mean of its divisors is an integer number (51059838457).
Almost surely, 2102119676913 is an apocalyptic number.
It is an amenable number.
102119676913 is a deficient number, since it is larger than the sum of its proper divisors (1).
102119676913 is an equidigital number, since it uses as much as digits as its factorization.
102119676913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 46.
The spelling of 102119676913 in words is "one hundred two billion, one hundred nineteen million, six hundred seventy-six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •