Base | Representation |
---|---|
bin | 1011000010110100010010… |
… | …0110001101000001100101 |
3 | 1120222212021011212012010222 |
4 | 2300231010212031001211 |
5 | 3042422402443130201 |
6 | 41454232234054125 |
7 | 2362206303652016 |
oct | 260550446150145 |
9 | 46885234765128 |
10 | 12143023411301 |
11 | 3961911169672 |
12 | 1441495b7a345 |
13 | 6a110b772143 |
14 | 2dda2298900d |
15 | 160d042ac91b |
hex | b0b4498d065 |
12143023411301 has 2 divisors, whose sum is σ = 12143023411302. Its totient is φ = 12143023411300.
The previous prime is 12143023411279. The next prime is 12143023411319. The reversal of 12143023411301 is 10311432034121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11239430580676 + 903592830625 = 3352526^2 + 950575^2 .
It is a cyclic number.
It is not a de Polignac number, because 12143023411301 - 218 = 12143023149157 is a prime.
It is a super-3 number, since 3×121430234113013 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12143023411201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6071511705650 + 6071511705651.
It is an arithmetic number, because the mean of its divisors is an integer number (6071511705651).
Almost surely, 212143023411301 is an apocalyptic number.
It is an amenable number.
12143023411301 is a deficient number, since it is larger than the sum of its proper divisors (1).
12143023411301 is an equidigital number, since it uses as much as digits as its factorization.
12143023411301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 12143023411301 its reverse (10311432034121), we get a palindrome (22454455445422).
The spelling of 12143023411301 in words is "twelve trillion, one hundred forty-three billion, twenty-three million, four hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •