Base | Representation |
---|---|
bin | 10000010111001101111… |
… | …010000000110100000101 |
3 | 10222111101020010021101012 |
4 | 100113031322000310011 |
5 | 121410323344014341 |
6 | 2220321105012005 |
7 | 144144460544606 |
oct | 20271572006405 |
9 | 3874336107335 |
10 | 1124441001221 |
11 | 3a39666a3a5a |
12 | 161b11024005 |
13 | 8205a570385 |
14 | 3c5cd4dbdad |
15 | 1e3b15540eb |
hex | 105cde80d05 |
1124441001221 has 2 divisors, whose sum is σ = 1124441001222. Its totient is φ = 1124441001220.
The previous prime is 1124441001157. The next prime is 1124441001239. The reversal of 1124441001221 is 1221001444211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1123093377121 + 1347624100 = 1059761^2 + 36710^2 .
It is a cyclic number.
It is not a de Polignac number, because 1124441001221 - 26 = 1124441001157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1124441001421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 562220500610 + 562220500611.
It is an arithmetic number, because the mean of its divisors is an integer number (562220500611).
Almost surely, 21124441001221 is an apocalyptic number.
It is an amenable number.
1124441001221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1124441001221 is an equidigital number, since it uses as much as digits as its factorization.
1124441001221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 1124441001221 its reverse (1221001444211), we get a palindrome (2345442445432).
The spelling of 1124441001221 in words is "one trillion, one hundred twenty-four billion, four hundred forty-one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •