Base | Representation |
---|---|
bin | 1011001011111101001001… |
… | …1000111110111100111101 |
3 | 1121112212111121202210201121 |
4 | 2302333102120332330331 |
5 | 3103010420402224432 |
6 | 42054315100110541 |
7 | 2406434663403424 |
oct | 262772230767475 |
9 | 47485447683647 |
10 | 12300021133117 |
11 | 3a124562a5793 |
12 | 14679b0235451 |
13 | 6b2b6ba0a5a3 |
14 | 3074778622bb |
15 | 164e423a6197 |
hex | b2fd263ef3d |
12300021133117 has 2 divisors, whose sum is σ = 12300021133118. Its totient is φ = 12300021133116.
The previous prime is 12300021133073. The next prime is 12300021133139. The reversal of 12300021133117 is 71133112000321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6402792579876 + 5897228553241 = 2530374^2 + 2428421^2 .
It is a cyclic number.
It is not a de Polignac number, because 12300021133117 - 243 = 3503928110909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12300021133091 and 12300021133100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12300021133717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6150010566558 + 6150010566559.
It is an arithmetic number, because the mean of its divisors is an integer number (6150010566559).
Almost surely, 212300021133117 is an apocalyptic number.
It is an amenable number.
12300021133117 is a deficient number, since it is larger than the sum of its proper divisors (1).
12300021133117 is an equidigital number, since it uses as much as digits as its factorization.
12300021133117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 12300021133117 its reverse (71133112000321), we get a palindrome (83433133133438).
The spelling of 12300021133117 in words is "twelve trillion, three hundred billion, twenty-one million, one hundred thirty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •