Base | Representation |
---|---|
bin | 1011001100001001000010… |
… | …0110010100101100001111 |
3 | 1121120011202000111221012022 |
4 | 2303002100212110230033 |
5 | 3103033434322113241 |
6 | 42100003454000355 |
7 | 2406610033030166 |
oct | 263022046245417 |
9 | 47504660457168 |
10 | 12303212301071 |
11 | 3a1384366647a |
12 | 1468540aa60bb |
13 | 6b3259ba6053 |
14 | 30769b5cc3dd |
15 | 16507c60c54b |
hex | b3090994b0f |
12303212301071 has 2 divisors, whose sum is σ = 12303212301072. Its totient is φ = 12303212301070.
The previous prime is 12303212301001. The next prime is 12303212301137. The reversal of 12303212301071 is 17010321230321.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12303212301071 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12303212301071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12303212301001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6151606150535 + 6151606150536.
It is an arithmetic number, because the mean of its divisors is an integer number (6151606150536).
Almost surely, 212303212301071 is an apocalyptic number.
12303212301071 is a deficient number, since it is larger than the sum of its proper divisors (1).
12303212301071 is an equidigital number, since it uses as much as digits as its factorization.
12303212301071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 12303212301071 its reverse (17010321230321), we get a palindrome (29313533531392).
The spelling of 12303212301071 in words is "twelve trillion, three hundred three billion, two hundred twelve million, three hundred one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •