Base | Representation |
---|---|
bin | 1011001101001000101101… |
… | …0011010111000010010001 |
3 | 1121121210212010021022001122 |
4 | 2303102023103113002101 |
5 | 3103323440122004131 |
6 | 42111511425412025 |
7 | 2411053413160343 |
oct | 263221323270221 |
9 | 47553763238048 |
10 | 12320303313041 |
11 | 3a20014037759 |
12 | 146b91079a015 |
13 | 6b4a519b3b99 |
14 | 30843d3dd293 |
15 | 16572ccb0d7b |
hex | b348b4d7091 |
12320303313041 has 2 divisors, whose sum is σ = 12320303313042. Its totient is φ = 12320303313040.
The previous prime is 12320303313013. The next prime is 12320303313047. The reversal of 12320303313041 is 14031330302321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7354184659600 + 4966118653441 = 2711860^2 + 2228479^2 .
It is a cyclic number.
It is not a de Polignac number, because 12320303313041 - 238 = 12045425406097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12320303313041.
It is not a weakly prime, because it can be changed into another prime (12320303313047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6160151656520 + 6160151656521.
It is an arithmetic number, because the mean of its divisors is an integer number (6160151656521).
Almost surely, 212320303313041 is an apocalyptic number.
It is an amenable number.
12320303313041 is a deficient number, since it is larger than the sum of its proper divisors (1).
12320303313041 is an equidigital number, since it uses as much as digits as its factorization.
12320303313041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 12320303313041 its reverse (14031330302321), we get a palindrome (26351633615362).
The spelling of 12320303313041 in words is "twelve trillion, three hundred twenty billion, three hundred three million, three hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •