Base | Representation |
---|---|
bin | 1000111110101100… |
… | …0001111101101001 |
3 | 20012222122010112101 |
4 | 2033223001331221 |
5 | 14414032001441 |
6 | 1035103413401 |
7 | 113506151512 |
oct | 21753017551 |
9 | 6188563471 |
10 | 2410422121 |
11 | 10276908a8 |
12 | 5732b4261 |
13 | 2c54c76a3 |
14 | 18c1b3a09 |
15 | e1934231 |
hex | 8fac1f69 |
2410422121 has 2 divisors, whose sum is σ = 2410422122. Its totient is φ = 2410422120.
The previous prime is 2410422109. The next prime is 2410422127. The reversal of 2410422121 is 1212240142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1414136025 + 996286096 = 37605^2 + 31564^2 .
It is a cyclic number.
It is not a de Polignac number, because 2410422121 - 227 = 2276204393 is a prime.
It is a super-2 number, since 2×24104221212 = 11620269602812277282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2410422127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1205211060 + 1205211061.
It is an arithmetic number, because the mean of its divisors is an integer number (1205211061).
Almost surely, 22410422121 is an apocalyptic number.
It is an amenable number.
2410422121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2410422121 is an equidigital number, since it uses as much as digits as its factorization.
2410422121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 19.
The square root of 2410422121 is about 49096.0499531276. The cubic root of 2410422121 is about 1340.8011324713.
Adding to 2410422121 its reverse (1212240142), we get a palindrome (3622662263).
It can be divided in two parts, 24104 and 22121, that added together give a square (46225 = 2152).
The spelling of 2410422121 in words is "two billion, four hundred ten million, four hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •