Base | Representation |
---|---|
bin | 101011111100100110101… |
… | …111111100000100101001 |
3 | 101200201011211120210122212 |
4 | 223330212233330010221 |
5 | 343434441100010441 |
6 | 10231212512254505 |
7 | 431121500246336 |
oct | 53744657740451 |
9 | 11621154523585 |
10 | 3020012110121 |
11 | a64864117266 |
12 | 40936bb41435 |
13 | 18ba2a887996 |
14 | a6252a5198d |
15 | 538565a2eeb |
hex | 2bf26bfc129 |
3020012110121 has 2 divisors, whose sum is σ = 3020012110122. Its totient is φ = 3020012110120.
The previous prime is 3020012110103. The next prime is 3020012110123. The reversal of 3020012110121 is 1210112100203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1833481191721 + 1186530918400 = 1354061^2 + 1089280^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3020012110121 is a prime.
Together with 3020012110123, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3020012110096 and 3020012110105.
It is not a weakly prime, because it can be changed into another prime (3020012110123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510006055060 + 1510006055061.
It is an arithmetic number, because the mean of its divisors is an integer number (1510006055061).
Almost surely, 23020012110121 is an apocalyptic number.
It is an amenable number.
3020012110121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020012110121 is an equidigital number, since it uses as much as digits as its factorization.
3020012110121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 3020012110121 its reverse (1210112100203), we get a palindrome (4230124210324).
The spelling of 3020012110121 in words is "three trillion, twenty billion, twelve million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •