Base | Representation |
---|---|
bin | 101111011111110101… |
… | …1100101001110000101 |
3 | 100202021120020000001111 |
4 | 1132333223211032011 |
5 | 3132344012330314 |
6 | 114505212325021 |
7 | 10240441502134 |
oct | 1367753451605 |
9 | 322246200044 |
10 | 102000120709 |
11 | 3a292455423 |
12 | 17927773771 |
13 | 9806cc9a16 |
14 | 4d1894b91b |
15 | 29beb22ec4 |
hex | 17bfae5385 |
102000120709 has 2 divisors, whose sum is σ = 102000120710. Its totient is φ = 102000120708.
The previous prime is 102000120701. The next prime is 102000120713. The reversal of 102000120709 is 907021000201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60863357025 + 41136763684 = 246705^2 + 202822^2 .
It is a cyclic number.
It is not a de Polignac number, because 102000120709 - 23 = 102000120701 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102000120709.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102000120701) 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, 51000060354 + 51000060355.
It is an arithmetic number, because the mean of its divisors is an integer number (51000060355).
Almost surely, 2102000120709 is an apocalyptic number.
It is an amenable number.
102000120709 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000120709 is an equidigital number, since it uses as much as digits as its factorization.
102000120709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
The spelling of 102000120709 in words is "one hundred two billion, one hundred twenty thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •