Base | Representation |
---|---|
bin | 1011101001011110000… |
… | …0111000010000001101 |
3 | 201010112001011100200102 |
4 | 2322113200320100031 |
5 | 11234311240134003 |
6 | 231532433540445 |
7 | 20312631652244 |
oct | 2722740702015 |
9 | 633461140612 |
10 | 200110474253 |
11 | 77959167138 |
12 | 32948714725 |
13 | 15b4118c361 |
14 | 9984a3b95b |
15 | 5312ee7588 |
hex | 2e9783840d |
200110474253 has 2 divisors, whose sum is σ = 200110474254. Its totient is φ = 200110474252.
The previous prime is 200110474247. The next prime is 200110474303. The reversal of 200110474253 is 352474011002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 152297404009 + 47813070244 = 390253^2 + 218662^2 .
It is a cyclic number.
It is not a de Polignac number, because 200110474253 - 26 = 200110474189 is a prime.
It is a super-3 number, since 3×2001104742533 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200110470253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100055237126 + 100055237127.
It is an arithmetic number, because the mean of its divisors is an integer number (100055237127).
Almost surely, 2200110474253 is an apocalyptic number.
It is an amenable number.
200110474253 is a deficient number, since it is larger than the sum of its proper divisors (1).
200110474253 is an equidigital number, since it uses as much as digits as its factorization.
200110474253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720, while the sum is 29.
Adding to 200110474253 its reverse (352474011002), we get a palindrome (552584485255).
The spelling of 200110474253 in words is "two hundred billion, one hundred ten million, four hundred seventy-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •