Base | Representation |
---|---|
bin | 11110001100101101011… |
… | …011010010011011101001 |
3 | 21100101112102212111100102 |
4 | 132030231123102123221 |
5 | 233000033210111243 |
6 | 4225203105315145 |
7 | 302634111163514 |
oct | 36145533223351 |
9 | 7311472774312 |
10 | 2075231332073 |
11 | 730111a93099 |
12 | 29623a935ab5 |
13 | 120902744c93 |
14 | 72628183d7b |
15 | 38eac9dc9b8 |
hex | 1e32d6d26e9 |
2075231332073 has 2 divisors, whose sum is σ = 2075231332074. Its totient is φ = 2075231332072.
The previous prime is 2075231332019. The next prime is 2075231332093. The reversal of 2075231332073 is 3702331325702.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1899140316649 + 176091015424 = 1378093^2 + 419632^2 .
It is a cyclic number.
It is not a de Polignac number, because 2075231332073 - 212 = 2075231327977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2075231332093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1037615666036 + 1037615666037.
It is an arithmetic number, because the mean of its divisors is an integer number (1037615666037).
Almost surely, 22075231332073 is an apocalyptic number.
It is an amenable number.
2075231332073 is a deficient number, since it is larger than the sum of its proper divisors (1).
2075231332073 is an equidigital number, since it uses as much as digits as its factorization.
2075231332073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 158760, while the sum is 38.
Adding to 2075231332073 its reverse (3702331325702), we get a palindrome (5777562657775).
The spelling of 2075231332073 in words is "two trillion, seventy-five billion, two hundred thirty-one million, three hundred thirty-two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •