Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111010010101111110011001 |
3 | 222020212220112010220202011201 |
4 | 231201130101322111332121 |
5 | 202220220442424310243 |
6 | 1545451144022354201 |
7 | 60112465264365622 |
oct | 5541342172257631 |
9 | 866786463822151 |
10 | 200210201010073 |
11 | 5887a740001391 |
12 | 1a5560b328b961 |
13 | 8793982b17497 |
14 | 3762322830a49 |
15 | 1822dd7d7a04d |
hex | b61711e95f99 |
200210201010073 has 2 divisors, whose sum is σ = 200210201010074. Its totient is φ = 200210201010072.
The previous prime is 200210201009969. The next prime is 200210201010107. The reversal of 200210201010073 is 370010102012002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 164081061404569 + 36129139605504 = 12809413^2 + 6010752^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210201010073 - 229 = 200209664139161 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200210201010073.
It is not a weakly prime, because it can be changed into another prime (200210201010173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105100505036 + 100105100505037.
It is an arithmetic number, because the mean of its divisors is an integer number (100105100505037).
Almost surely, 2200210201010073 is an apocalyptic number.
It is an amenable number.
200210201010073 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210201010073 is an equidigital number, since it uses as much as digits as its factorization.
200210201010073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 200210201010073 its reverse (370010102012002), we get a palindrome (570220303022075).
The spelling of 200210201010073 in words is "two hundred trillion, two hundred ten billion, two hundred one million, ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •