Base | Representation |
---|---|
bin | 101101100001101010100111… |
… | …110100111001000100100011 |
3 | 222020221101021101211121101201 |
4 | 231201222213310321010203 |
5 | 202220444012333042001 |
6 | 1545502212111142031 |
7 | 60113552022606646 |
oct | 5541524764710443 |
9 | 866841241747351 |
10 | 200225601065251 |
11 | 58886222a26813 |
12 | 1a559090814917 |
13 | 87952684c3c78 |
14 | 3762d83c31a5d |
15 | 18234d9d64501 |
hex | b61aa7d39123 |
200225601065251 has 2 divisors, whose sum is σ = 200225601065252. Its totient is φ = 200225601065250.
The previous prime is 200225601065221. The next prime is 200225601065299. The reversal of 200225601065251 is 152560106522002.
200225601065251 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 is a cyclic number.
It is not a de Polignac number, because 200225601065251 - 27 = 200225601065123 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200225601065251.
It is not a weakly prime, because it can be changed into another prime (200225601065201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100112800532625 + 100112800532626.
It is an arithmetic number, because the mean of its divisors is an integer number (100112800532626).
Almost surely, 2200225601065251 is an apocalyptic number.
200225601065251 is a deficient number, since it is larger than the sum of its proper divisors (1).
200225601065251 is an equidigital number, since it uses as much as digits as its factorization.
200225601065251 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 200225601065251 its reverse (152560106522002), we get a palindrome (352785707587253).
The spelling of 200225601065251 in words is "two hundred trillion, two hundred twenty-five billion, six hundred one million, sixty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •