Base | Representation |
---|---|
bin | 111101100010110… |
… | …0010101000001001 |
3 | 12022220202102012211 |
4 | 1323011202220021 |
5 | 13212123100441 |
6 | 540525105121 |
7 | 102113431201 |
oct | 17305425011 |
9 | 5286672184 |
10 | 2065050121 |
11 | 96a7377a2 |
12 | 4976b81a1 |
13 | 26baa1b64 |
14 | 15838d401 |
15 | c1461a81 |
hex | 7b162a09 |
2065050121 has 2 divisors, whose sum is σ = 2065050122. Its totient is φ = 2065050120.
The previous prime is 2065050107. The next prime is 2065050149. The reversal of 2065050121 is 1210505602.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1671583225 + 393466896 = 40885^2 + 19836^2 .
It is a cyclic number.
It is not a de Polignac number, because 2065050121 - 213 = 2065041929 is a prime.
It is a super-3 number, since 3×20650501213 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 2065050092 and 2065050101.
It is not a weakly prime, because it can be changed into another prime (2065050161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1032525060 + 1032525061.
It is an arithmetic number, because the mean of its divisors is an integer number (1032525061).
Almost surely, 22065050121 is an apocalyptic number.
It is an amenable number.
2065050121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2065050121 is an equidigital number, since it uses as much as digits as its factorization.
2065050121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 2065050121 is about 45442.8225465804. The cubic root of 2065050121 is about 1273.4352447984.
Adding to 2065050121 its reverse (1210505602), we get a palindrome (3275555723).
The spelling of 2065050121 in words is "two billion, sixty-five million, fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •