Base | Representation |
---|---|
bin | 10010100000011101111… |
… | …011010111011101010101 |
3 | 11111120202210110002200211 |
4 | 102200131323113131111 |
5 | 131314132434441321 |
6 | 2412132414005421 |
7 | 160612461133201 |
oct | 22403573273525 |
9 | 4446683402624 |
10 | 1271812421461 |
11 | 450410a5723a |
12 | 18659b4a6871 |
13 | 92c1538119a |
14 | 457adb2bb01 |
15 | 231394aa0e1 |
hex | 1281ded7755 |
1271812421461 has 2 divisors, whose sum is σ = 1271812421462. Its totient is φ = 1271812421460.
The previous prime is 1271812421447. The next prime is 1271812421501. The reversal of 1271812421461 is 1641242181721.
It is an a-pointer prime, because the next prime (1271812421501) can be obtained adding 1271812421461 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 823138852900 + 448673568561 = 907270^2 + 669831^2 .
It is a cyclic number.
It is not a de Polignac number, because 1271812421461 - 217 = 1271812290389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1271812421441) 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, 635906210730 + 635906210731.
It is an arithmetic number, because the mean of its divisors is an integer number (635906210731).
Almost surely, 21271812421461 is an apocalyptic number.
It is an amenable number.
1271812421461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1271812421461 is an equidigital number, since it uses as much as digits as its factorization.
1271812421461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 43008, while the sum is 40.
The spelling of 1271812421461 in words is "one trillion, two hundred seventy-one billion, eight hundred twelve million, four hundred twenty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •