Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …110101110001001101110001 |
3 | 111101111122222021000110012121 |
4 | 113031300002311301031301 |
5 | 101340301310103211121 |
6 | 1001052032553354241 |
7 | 30335324301332125 |
oct | 2715600265611561 |
9 | 441448867013177 |
10 | 102100010210161 |
11 | 2a59440a027107 |
12 | b54b7baa08981 |
13 | 44c7cb3353162 |
14 | 1b2d949c1d585 |
15 | bc0cc7852141 |
hex | 5cdc02d71371 |
102100010210161 has 2 divisors, whose sum is σ = 102100010210162. Its totient is φ = 102100010210160.
The previous prime is 102100010210101. The next prime is 102100010210183. The reversal of 102100010210161 is 161012010001201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100944600200161 + 1155410010000 = 10047119^2 + 1074900^2 .
It is a cyclic number.
It is not a de Polignac number, because 102100010210161 - 241 = 99900986954609 is a prime.
It is not a weakly prime, because it can be changed into another prime (102100010210101) 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, 51050005105080 + 51050005105081.
It is an arithmetic number, because the mean of its divisors is an integer number (51050005105081).
Almost surely, 2102100010210161 is an apocalyptic number.
It is an amenable number.
102100010210161 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100010210161 is an equidigital number, since it uses as much as digits as its factorization.
102100010210161 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 16.
Adding to 102100010210161 its reverse (161012010001201), we get a palindrome (263112020211362).
The spelling of 102100010210161 in words is "one hundred two trillion, one hundred billion, ten million, two hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •