Base | Representation |
---|---|
bin | 111111001101011… |
… | …1111000010100101 |
3 | 12110211001010101002 |
4 | 1332122333002211 |
5 | 13320434100143 |
6 | 550244243045 |
7 | 103363141502 |
oct | 17632770245 |
9 | 5424033332 |
10 | 2121003173 |
11 | 999284093 |
12 | 4b23a0485 |
13 | 27a562a83 |
14 | 1619964a9 |
15 | c63155b8 |
hex | 7e6bf0a5 |
2121003173 has 2 divisors, whose sum is σ = 2121003174. Its totient is φ = 2121003172.
The previous prime is 2121003149. The next prime is 2121003187. The reversal of 2121003173 is 3713001212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1162605409 + 958397764 = 34097^2 + 30958^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2121003173 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2121008173) 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, 1060501586 + 1060501587.
It is an arithmetic number, because the mean of its divisors is an integer number (1060501587).
Almost surely, 22121003173 is an apocalyptic number.
It is an amenable number.
2121003173 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121003173 is an equidigital number, since it uses as much as digits as its factorization.
2121003173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 20.
The square root of 2121003173 is about 46054.3502071194. The cubic root of 2121003173 is about 1284.8342527718.
Adding to 2121003173 its reverse (3713001212), we get a palindrome (5834004385).
The spelling of 2121003173 in words is "two billion, one hundred twenty-one million, three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •