Base | Representation |
---|---|
bin | 1011001100001000101111… |
… | …0101010000100011111001 |
3 | 1121120011112110000222211102 |
4 | 2303002023311100203321 |
5 | 3103033303334031413 |
6 | 42055551515541145 |
7 | 2406605042215103 |
oct | 263021365204371 |
9 | 47504473028742 |
10 | 12303132330233 |
11 | 3a13802505178 |
12 | 146851a15a7b5 |
13 | 6b3246456024 |
14 | 307690b32573 |
15 | 1650755b2458 |
hex | b308bd508f9 |
12303132330233 has 2 divisors, whose sum is σ = 12303132330234. Its totient is φ = 12303132330232.
The previous prime is 12303132330191. The next prime is 12303132330271. The reversal of 12303132330233 is 33203323130321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11434055319184 + 869077011049 = 3381428^2 + 932243^2 .
It is a cyclic number.
It is not a de Polignac number, because 12303132330233 - 26 = 12303132330169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12303132330196 and 12303132330205.
It is not a weakly prime, because it can be changed into another prime (12303132330133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6151566165116 + 6151566165117.
It is an arithmetic number, because the mean of its divisors is an integer number (6151566165117).
Almost surely, 212303132330233 is an apocalyptic number.
It is an amenable number.
12303132330233 is a deficient number, since it is larger than the sum of its proper divisors (1).
12303132330233 is an equidigital number, since it uses as much as digits as its factorization.
12303132330233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 12303132330233 its reverse (33203323130321), we get a palindrome (45506455460554).
The spelling of 12303132330233 in words is "twelve trillion, three hundred three billion, one hundred thirty-two million, three hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •