Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …0001110000010011001 |
3 | 201010202100111200222221 |
4 | 2322130322032002121 |
5 | 11240002424100121 |
6 | 231545430144041 |
7 | 20315111310025 |
oct | 2723472160231 |
9 | 633670450887 |
10 | 200201003161 |
11 | 779a5279915 |
12 | 32972ab2021 |
13 | 15b56b67c63 |
14 | 9992a85385 |
15 | 531ae2ab41 |
hex | 2e9ce8e099 |
200201003161 has 2 divisors, whose sum is σ = 200201003162. Its totient is φ = 200201003160.
The previous prime is 200201003137. The next prime is 200201003209. The reversal of 200201003161 is 161300102002.
200201003161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137222089225 + 62978913936 = 370435^2 + 250956^2 .
It is a cyclic number.
It is not a de Polignac number, because 200201003161 - 27 = 200201003033 is a prime.
It is not a weakly prime, because it can be changed into another prime (200201003111) 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, 100100501580 + 100100501581.
It is an arithmetic number, because the mean of its divisors is an integer number (100100501581).
Almost surely, 2200201003161 is an apocalyptic number.
It is an amenable number.
200201003161 is a deficient number, since it is larger than the sum of its proper divisors (1).
200201003161 is an equidigital number, since it uses as much as digits as its factorization.
200201003161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 200201003161 its reverse (161300102002), we get a palindrome (361501105163).
The spelling of 200201003161 in words is "two hundred billion, two hundred one million, three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •