Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …110110010001011101111001 |
3 | 111021022201112002100000101102 |
4 | 113000222302312101131321 |
5 | 101231034142110000441 |
6 | 555123035021301145 |
7 | 30213350421535466 |
oct | 2700526266213571 |
9 | 437281462300342 |
10 | 101201020000121 |
11 | 2a278125537478 |
12 | b425528a047b5 |
13 | 44612a4b51302 |
14 | 1adc2269b266d |
15 | ba770dcdc69b |
hex | 5c0ab2d91779 |
101201020000121 has 2 divisors, whose sum is σ = 101201020000122. Its totient is φ = 101201020000120.
The previous prime is 101201020000063. The next prime is 101201020000123. The reversal of 101201020000121 is 121000020102101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92941862484496 + 8259157515625 = 9640636^2 + 2873875^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101201020000121 is a prime.
Together with 101201020000123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101201020000123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600510000060 + 50600510000061.
It is an arithmetic number, because the mean of its divisors is an integer number (50600510000061).
Almost surely, 2101201020000121 is an apocalyptic number.
It is an amenable number.
101201020000121 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201020000121 is an equidigital number, since it uses as much as digits as its factorization.
101201020000121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101201020000121 its reverse (121000020102101), we get a palindrome (222201040102222).
The spelling of 101201020000121 in words is "one hundred one trillion, two hundred one billion, twenty million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •