Base | Representation |
---|---|
bin | 1011010011000111101101… |
… | …0100010011011111011001 |
3 | 1121222122020012100121210112 |
4 | 2310301323110103133121 |
5 | 3112020014232342223 |
6 | 42231033330454105 |
7 | 2421353232402545 |
oct | 264617324233731 |
9 | 47878205317715 |
10 | 12423114340313 |
11 | 3a5a6821a2196 |
12 | 1487823a34335 |
13 | 6c16579b1b71 |
14 | 30d3d3914a25 |
15 | 168248bb2778 |
hex | b4c7b5137d9 |
12423114340313 has 2 divisors, whose sum is σ = 12423114340314. Its totient is φ = 12423114340312.
The previous prime is 12423114340309. The next prime is 12423114340361. The reversal of 12423114340313 is 31304341132421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11865565397449 + 557548942864 = 3444643^2 + 746692^2 .
It is a cyclic number.
It is not a de Polignac number, because 12423114340313 - 22 = 12423114340309 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12423114340313.
It is not a weakly prime, because it can be changed into another prime (12423114340613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6211557170156 + 6211557170157.
It is an arithmetic number, because the mean of its divisors is an integer number (6211557170157).
Almost surely, 212423114340313 is an apocalyptic number.
It is an amenable number.
12423114340313 is a deficient number, since it is larger than the sum of its proper divisors (1).
12423114340313 is an equidigital number, since it uses as much as digits as its factorization.
12423114340313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 12423114340313 its reverse (31304341132421), we get a palindrome (43727455472734).
The spelling of 12423114340313 in words is "twelve trillion, four hundred twenty-three billion, one hundred fourteen million, three hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •