Base | Representation |
---|---|
bin | 1011001000000000011111… |
… | …1100010110011111111001 |
3 | 1121022101110001120101100111 |
4 | 2302000013330112133321 |
5 | 3100403021212322223 |
6 | 42003221204304321 |
7 | 2401514215325215 |
oct | 262000774263771 |
9 | 47271401511314 |
10 | 12232200120313 |
11 | 3996713090a88 |
12 | 14568230a20a1 |
13 | 6a9650b48194 |
14 | 3040823b7945 |
15 | 1632c321130d |
hex | b2007f167f9 |
12232200120313 has 2 divisors, whose sum is σ = 12232200120314. Its totient is φ = 12232200120312.
The previous prime is 12232200120293. The next prime is 12232200120319. The reversal of 12232200120313 is 31302100223221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8995122660969 + 3237077459344 = 2999187^2 + 1799188^2 .
It is a cyclic number.
It is not a de Polignac number, because 12232200120313 - 25 = 12232200120281 is a prime.
It is not a weakly prime, because it can be changed into another prime (12232200120319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6116100060156 + 6116100060157.
It is an arithmetic number, because the mean of its divisors is an integer number (6116100060157).
Almost surely, 212232200120313 is an apocalyptic number.
It is an amenable number.
12232200120313 is a deficient number, since it is larger than the sum of its proper divisors (1).
12232200120313 is an equidigital number, since it uses as much as digits as its factorization.
12232200120313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12232200120313 its reverse (31302100223221), we get a palindrome (43534300343534).
The spelling of 12232200120313 in words is "twelve trillion, two hundred thirty-two billion, two hundred million, one hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •