Base | Representation |
---|---|
bin | 100001100001001001010… |
… | …010010010100101001001 |
3 | 22011012022011112010100011 |
4 | 201201021102102211021 |
5 | 300214210443031441 |
6 | 4522045222311521 |
7 | 325260466660333 |
oct | 41411122224511 |
9 | 8135264463304 |
10 | 2303332002121 |
11 | 80892395a647 |
12 | 3124992885a1 |
13 | 13928479b667 |
14 | 7d6a633c453 |
15 | 3edace61581 |
hex | 21849492949 |
2303332002121 has 2 divisors, whose sum is σ = 2303332002122. Its totient is φ = 2303332002120.
The previous prime is 2303332002119. The next prime is 2303332002131. The reversal of 2303332002121 is 1212002333032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2292389796096 + 10942206025 = 1514064^2 + 104605^2 .
It is a cyclic number.
It is not a de Polignac number, because 2303332002121 - 21 = 2303332002119 is a prime.
Together with 2303332002119, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2303332002092 and 2303332002101.
It is not a weakly prime, because it can be changed into another prime (2303332002131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1151666001060 + 1151666001061.
It is an arithmetic number, because the mean of its divisors is an integer number (1151666001061).
Almost surely, 22303332002121 is an apocalyptic number.
It is an amenable number.
2303332002121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2303332002121 is an equidigital number, since it uses as much as digits as its factorization.
2303332002121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 2303332002121 its reverse (1212002333032), we get a palindrome (3515334335153).
The spelling of 2303332002121 in words is "two trillion, three hundred three billion, three hundred thirty-two million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •