Base | Representation |
---|---|
bin | 10011001101100010001… |
… | …111101001101110101001 |
3 | 11200012200020021212210102 |
4 | 103031202033221232221 |
5 | 133112234011330441 |
6 | 2450254252555145 |
7 | 164244603205046 |
oct | 23154217515651 |
9 | 4605606255712 |
10 | 1320203230121 |
11 | 46999333aa96 |
12 | 193a45482ab5 |
13 | 9765791a689 |
14 | 47c808541cd |
15 | 2451c93769b |
hex | 133623e9ba9 |
1320203230121 has 2 divisors, whose sum is σ = 1320203230122. Its totient is φ = 1320203230120.
The previous prime is 1320203230109. The next prime is 1320203230123. The reversal of 1320203230121 is 1210323020231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1071202230121 + 249001000000 = 1034989^2 + 499000^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320203230121 - 218 = 1320202967977 is a prime.
Together with 1320203230123, 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 = 1320203230093 and 1320203230102.
It is not a weakly prime, because it can be changed into another prime (1320203230123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660101615060 + 660101615061.
It is an arithmetic number, because the mean of its divisors is an integer number (660101615061).
Almost surely, 21320203230121 is an apocalyptic number.
It is an amenable number.
1320203230121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320203230121 is an equidigital number, since it uses as much as digits as its factorization.
1320203230121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1320203230121 its reverse (1210323020231), we get a palindrome (2530526250352).
The spelling of 1320203230121 in words is "one trillion, three hundred twenty billion, two hundred three million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •