Base | Representation |
---|---|
bin | 1011001100001001011100… |
… | …0001001101000101010101 |
3 | 1121120012000112012011120101 |
4 | 2303002113001031011111 |
5 | 3103034144410323333 |
6 | 42100022302334101 |
7 | 2406612511403446 |
oct | 263022701150525 |
9 | 47505015164511 |
10 | 12303320011093 |
11 | 3a13899443621 |
12 | 1468570b8a331 |
13 | 6b32762b8ca7 |
14 | 3076aba292cd |
15 | 165086cd667d |
hex | b309704d155 |
12303320011093 has 2 divisors, whose sum is σ = 12303320011094. Its totient is φ = 12303320011092.
The previous prime is 12303320011079. The next prime is 12303320011123. The reversal of 12303320011093 is 39011002330321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12054277093329 + 249042917764 = 3471927^2 + 499042^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12303320011093 is a prime.
It is a super-2 number, since 2×123033200110932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12303320011033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6151660005546 + 6151660005547.
It is an arithmetic number, because the mean of its divisors is an integer number (6151660005547).
Almost surely, 212303320011093 is an apocalyptic number.
It is an amenable number.
12303320011093 is a deficient number, since it is larger than the sum of its proper divisors (1).
12303320011093 is an equidigital number, since it uses as much as digits as its factorization.
12303320011093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 12303320011093 in words is "twelve trillion, three hundred three billion, three hundred twenty million, eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •