Base | Representation |
---|---|
bin | 1011001101101101001101… |
… | …0110110110001000111101 |
3 | 1121122202011000110022121201 |
4 | 2303123103112312020331 |
5 | 3104004022120333041 |
6 | 42120212024055501 |
7 | 2411551265521546 |
oct | 263332326661075 |
9 | 47582130408551 |
10 | 12330102121021 |
11 | 3a24192225173 |
12 | 14717a6304591 |
13 | 6b5953aba609 |
14 | 308acc94d4cd |
15 | 165b0317b631 |
hex | b36d35b623d |
12330102121021 has 2 divisors, whose sum is σ = 12330102121022. Its totient is φ = 12330102121020.
The previous prime is 12330102120961. The next prime is 12330102121079. The reversal of 12330102121021 is 12012120103321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9825435048025 + 2504667072996 = 3134555^2 + 1582614^2 .
It is a cyclic number.
It is not a de Polignac number, because 12330102121021 - 213 = 12330102112829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12330102121021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12330102121721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6165051060510 + 6165051060511.
It is an arithmetic number, because the mean of its divisors is an integer number (6165051060511).
Almost surely, 212330102121021 is an apocalyptic number.
It is an amenable number.
12330102121021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12330102121021 is an equidigital number, since it uses as much as digits as its factorization.
12330102121021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12330102121021 its reverse (12012120103321), we get a palindrome (24342222224342).
The spelling of 12330102121021 in words is "twelve trillion, three hundred thirty billion, one hundred two million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •