Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …001101000011011001000001 |
3 | 111101111200012112100102001122 |
4 | 113031300020031003121001 |
5 | 101340302001122400001 |
6 | 1001052045530242025 |
7 | 30335326443253151 |
oct | 2715601015033101 |
9 | 441450175312048 |
10 | 102100100200001 |
11 | 2a594455900882 |
12 | b54b824b86315 |
13 | 44c7cc8ba0597 |
14 | 1b2d957b66761 |
15 | bc0cd06cab1b |
hex | 5cdc08343641 |
102100100200001 has 2 divisors, whose sum is σ = 102100100200002. Its totient is φ = 102100100200000.
The previous prime is 102100100199967. The next prime is 102100100200013. The reversal of 102100100200001 is 100002001001201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59126503269376 + 42973596930625 = 7689376^2 + 6555425^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102100100200001 is a prime.
It is not a weakly prime, because it can be changed into another prime (102100100200051) 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, 51050050100000 + 51050050100001.
It is an arithmetic number, because the mean of its divisors is an integer number (51050050100001).
Almost surely, 2102100100200001 is an apocalyptic number.
It is an amenable number.
102100100200001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100100200001 is an equidigital number, since it uses as much as digits as its factorization.
102100100200001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 102100100200001 its reverse (100002001001201), we get a palindrome (202102101201202).
The spelling of 102100100200001 in words is "one hundred two trillion, one hundred billion, one hundred million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •