Base | Representation |
---|---|
bin | 10001110001010001010… |
… | …000100010000011010101 |
3 | 11022201221221001120020211 |
4 | 101301101100202003111 |
5 | 130001340301002331 |
6 | 2332551535325421 |
7 | 154136560512253 |
oct | 21612120420325 |
9 | 4281857046224 |
10 | 1221134000341 |
11 | 430975343382 |
12 | 1787b7380871 |
13 | 8b1c9bb9058 |
14 | 4316327d5d3 |
15 | 21b702a68b1 |
hex | 11c514220d5 |
1221134000341 has 2 divisors, whose sum is σ = 1221134000342. Its totient is φ = 1221134000340.
The previous prime is 1221134000287. The next prime is 1221134000371. The reversal of 1221134000341 is 1430004311221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 909440693316 + 311693307025 = 953646^2 + 558295^2 .
It is a cyclic number.
It is not a de Polignac number, because 1221134000341 - 225 = 1221100445909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1221134000371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610567000170 + 610567000171.
It is an arithmetic number, because the mean of its divisors is an integer number (610567000171).
Almost surely, 21221134000341 is an apocalyptic number.
It is an amenable number.
1221134000341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221134000341 is an equidigital number, since it uses as much as digits as its factorization.
1221134000341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1221134000341 its reverse (1430004311221), we get a palindrome (2651138311562).
It can be divided in two parts, 1221 and 134000341, that multiplied together give a palindrome (163614416361).
The spelling of 1221134000341 in words is "one trillion, two hundred twenty-one billion, one hundred thirty-four million, three hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •