Base | Representation |
---|---|
bin | 111111001101100… |
… | …0011011100111001 |
3 | 12110211002001011021 |
4 | 1332123003130321 |
5 | 13320440134431 |
6 | 550244502441 |
7 | 103363245253 |
oct | 17633033471 |
9 | 5424061137 |
10 | 2121021241 |
11 | 999296719 |
12 | 4b23aaa21 |
13 | 27a56b071 |
14 | 16199ccd3 |
15 | c631ab11 |
hex | 7e6c3739 |
2121021241 has 2 divisors, whose sum is σ = 2121021242. Its totient is φ = 2121021240.
The previous prime is 2121021233. The next prime is 2121021247. The reversal of 2121021241 is 1421201212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1672810000 + 448211241 = 40900^2 + 21171^2 .
It is a cyclic number.
It is not a de Polignac number, because 2121021241 - 23 = 2121021233 is a prime.
It is a super-2 number, since 2×21210212412 = 8997462209546360162, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2121021247) 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, 1060510620 + 1060510621.
It is an arithmetic number, because the mean of its divisors is an integer number (1060510621).
Almost surely, 22121021241 is an apocalyptic number.
It is an amenable number.
2121021241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121021241 is an equidigital number, since it uses as much as digits as its factorization.
2121021241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 2121021241 is about 46054.5463662384. The cubic root of 2121021241 is about 1284.8379010957.
Adding to 2121021241 its reverse (1421201212), we get a palindrome (3542222453).
The spelling of 2121021241 in words is "two billion, one hundred twenty-one million, twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •