Base | Representation |
---|---|
bin | 100001011111000100110… |
… | …111001111101111111001 |
3 | 22010222120100000222120122 |
4 | 201133010313033233321 |
5 | 300200133220220441 |
6 | 4521040540103025 |
7 | 325151441665334 |
oct | 41370467175771 |
9 | 8128510028518 |
10 | 2301110320121 |
11 | 807993871018 |
12 | 311b79234a75 |
13 | 138cbc418122 |
14 | 7d53525961b |
15 | 3ecccdb034b |
hex | 217c4dcfbf9 |
2301110320121 has 2 divisors, whose sum is σ = 2301110320122. Its totient is φ = 2301110320120.
The previous prime is 2301110320111. The next prime is 2301110320151. The reversal of 2301110320121 is 1210230111032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1970755514896 + 330354805225 = 1403836^2 + 574765^2 .
It is a cyclic number.
It is not a de Polignac number, because 2301110320121 - 222 = 2301106125817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2301110320121.
It is not a weakly prime, because it can be changed into another prime (2301110320111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150555160060 + 1150555160061.
It is an arithmetic number, because the mean of its divisors is an integer number (1150555160061).
Almost surely, 22301110320121 is an apocalyptic number.
It is an amenable number.
2301110320121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2301110320121 is an equidigital number, since it uses as much as digits as its factorization.
2301110320121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2301110320121 its reverse (1210230111032), we get a palindrome (3511340431153).
The spelling of 2301110320121 in words is "two trillion, three hundred one billion, one hundred ten million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •