Base | Representation |
---|---|
bin | 10001110000011111100… |
… | …011111111010010101001 |
3 | 11022122210211012011010201 |
4 | 101300133203333102221 |
5 | 124443133330140131 |
6 | 2332333113112201 |
7 | 154110114616231 |
oct | 21603743772251 |
9 | 4278724164121 |
10 | 1220300240041 |
11 | 430587743983 |
12 | 1786040b8661 |
13 | 8b0c624576c |
14 | 430c4646cc1 |
15 | 21b21eb1761 |
hex | 11c1f8ff4a9 |
1220300240041 has 2 divisors, whose sum is σ = 1220300240042. Its totient is φ = 1220300240040.
The previous prime is 1220300239997. The next prime is 1220300240059. The reversal of 1220300240041 is 1400420030221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1042806550041 + 177493690000 = 1021179^2 + 421300^2 .
It is an emirp because it is prime and its reverse (1400420030221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1220300240041 - 217 = 1220300108969 is a prime.
It is not a weakly prime, because it can be changed into another prime (1220300244041) 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, 610150120020 + 610150120021.
It is an arithmetic number, because the mean of its divisors is an integer number (610150120021).
Almost surely, 21220300240041 is an apocalyptic number.
It is an amenable number.
1220300240041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220300240041 is an equidigital number, since it uses as much as digits as its factorization.
1220300240041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 1220300240041 its reverse (1400420030221), we get a palindrome (2620720270262).
The spelling of 1220300240041 in words is "one trillion, two hundred twenty billion, three hundred million, two hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •