Base | Representation |
---|---|
bin | 101101100001011101111101… |
… | …110110101110110100101001 |
3 | 222020220002012100121200220001 |
4 | 231201131331312232310221 |
5 | 202220233200033040401 |
6 | 1545452043434303001 |
7 | 60112561204515334 |
oct | 5541357566566451 |
9 | 866802170550801 |
10 | 200212012002601 |
11 | 5888048a293925 |
12 | 1a556519887a61 |
13 | 8793bb1085ab1 |
14 | 376245516961b |
15 | 1822e91d55601 |
hex | b6177ddaed29 |
200212012002601 has 2 divisors, whose sum is σ = 200212012002602. Its totient is φ = 200212012002600.
The previous prime is 200212012002593. The next prime is 200212012002671. The reversal of 200212012002601 is 106200210212002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115689363298201 + 84522648704400 = 10755899^2 + 9193620^2 .
It is a cyclic number.
It is not a de Polignac number, because 200212012002601 - 23 = 200212012002593 is a prime.
It is not a weakly prime, because it can be changed into another prime (200212012002671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100106006001300 + 100106006001301.
It is an arithmetic number, because the mean of its divisors is an integer number (100106006001301).
Almost surely, 2200212012002601 is an apocalyptic number.
It is an amenable number.
200212012002601 is a deficient number, since it is larger than the sum of its proper divisors (1).
200212012002601 is an equidigital number, since it uses as much as digits as its factorization.
200212012002601 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 19.
Adding to 200212012002601 its reverse (106200210212002), we get a palindrome (306412222214603).
The spelling of 200212012002601 in words is "two hundred trillion, two hundred twelve billion, twelve million, two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •