Base | Representation |
---|---|
bin | 111100100100100… |
… | …0100010100011001 |
3 | 12020122100122021022 |
4 | 1321021010110121 |
5 | 13130244420441 |
6 | 533401452225 |
7 | 101236200044 |
oct | 17111042431 |
9 | 5218318238 |
10 | 2032420121 |
11 | 953280356 |
12 | 4887a1075 |
13 | 2650b8a74 |
14 | 153cd7c5b |
15 | bd66884b |
hex | 79244519 |
2032420121 has 2 divisors, whose sum is σ = 2032420122. Its totient is φ = 2032420120.
The previous prime is 2032420099. The next prime is 2032420133. The reversal of 2032420121 is 1210242302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2024010121 + 8410000 = 44989^2 + 2900^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2032420121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2032420121.
It is not a weakly prime, because it can be changed into another prime (2032423121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1016210060 + 1016210061.
It is an arithmetic number, because the mean of its divisors is an integer number (1016210061).
Almost surely, 22032420121 is an apocalyptic number.
It is an amenable number.
2032420121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2032420121 is an equidigital number, since it uses as much as digits as its factorization.
2032420121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 2032420121 is about 45082.3704012999. The cubic root of 2032420121 is about 1266.6923914982.
Adding to 2032420121 its reverse (1210242302), we get a palindrome (3242662423).
The spelling of 2032420121 in words is "two billion, thirty-two million, four hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •