Base | Representation |
---|---|
bin | 1000111110110101… |
… | …0110111000111001 |
3 | 20020000210010021222 |
4 | 2033231112320321 |
5 | 14414211011441 |
6 | 1035124441425 |
7 | 113514302111 |
oct | 21755267071 |
9 | 6200703258 |
10 | 2411032121 |
11 | 1027a68133 |
12 | 573549275 |
13 | 2c567c234 |
14 | 18c2d2041 |
15 | e1a04d4b |
hex | 8fb56e39 |
2411032121 has 2 divisors, whose sum is σ = 2411032122. Its totient is φ = 2411032120.
The previous prime is 2411032093. The next prime is 2411032133. The reversal of 2411032121 is 1212301142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2408355625 + 2676496 = 49075^2 + 1636^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2411032121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2411032121.
It is not a weakly prime, because it can be changed into another prime (2411032171) 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, 1205516060 + 1205516061.
It is an arithmetic number, because the mean of its divisors is an integer number (1205516061).
Almost surely, 22411032121 is an apocalyptic number.
It is an amenable number.
2411032121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2411032121 is an equidigital number, since it uses as much as digits as its factorization.
2411032121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 2411032121 is about 49102.2618725451. The cubic root of 2411032121 is about 1340.9142274212.
Adding to 2411032121 its reverse (1212301142), we get a palindrome (3623333263).
The spelling of 2411032121 in words is "two billion, four hundred eleven million, thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •