Base | Representation |
---|---|
bin | 101101101111111111011011… |
… | …010010100101111101100001 |
3 | 222101102111012200200110201021 |
4 | 231233333123102211331201 |
5 | 202333111101033000342 |
6 | 1551534334202005441 |
7 | 60244641445522312 |
oct | 5557773322457541 |
9 | 871374180613637 |
10 | 201210012000097 |
11 | 59125761270291 |
12 | 1a697a21aa6881 |
13 | 883703aba60a9 |
14 | 379888bb16609 |
15 | 183de02c08567 |
hex | b6ffdb4a5f61 |
201210012000097 has 2 divisors, whose sum is σ = 201210012000098. Its totient is φ = 201210012000096.
The previous prime is 201210011999951. The next prime is 201210012000119. The reversal of 201210012000097 is 790000210012102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 194414610973696 + 6795401026401 = 13943264^2 + 2606799^2 .
It is a cyclic number.
It is not a de Polignac number, because 201210012000097 - 215 = 201210011967329 is a prime.
It is not a weakly prime, because it can be changed into another prime (201210012000497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605006000048 + 100605006000049.
It is an arithmetic number, because the mean of its divisors is an integer number (100605006000049).
Almost surely, 2201210012000097 is an apocalyptic number.
It is an amenable number.
201210012000097 is a deficient number, since it is larger than the sum of its proper divisors (1).
201210012000097 is an equidigital number, since it uses as much as digits as its factorization.
201210012000097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 201210012000097 its reverse (790000210012102), we get a palindrome (991210222012199).
The spelling of 201210012000097 in words is "two hundred one trillion, two hundred ten billion, twelve million, ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •