Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …100111000000010101010101 |
3 | 222020212220021221112100020001 |
4 | 231201130030213000111111 |
5 | 202220220302141221423 |
6 | 1545451131124011301 |
7 | 60112463134313353 |
oct | 5541341447002525 |
9 | 866786257470201 |
10 | 200210112054613 |
11 | 5887a6a4873881 |
12 | 1a556089530b31 |
13 | 879396a56cb0b |
14 | 3762314ab67d3 |
15 | 1822dd0157cad |
hex | b6170c9c0555 |
200210112054613 has 2 divisors, whose sum is σ = 200210112054614. Its totient is φ = 200210112054612.
The previous prime is 200210112054593. The next prime is 200210112054619. The reversal of 200210112054613 is 316450211012002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 160275017640529 + 39935094414084 = 12659977^2 + 6319422^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210112054613 - 25 = 200210112054581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210112054619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105056027306 + 100105056027307.
It is an arithmetic number, because the mean of its divisors is an integer number (100105056027307).
Almost surely, 2200210112054613 is an apocalyptic number.
It is an amenable number.
200210112054613 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210112054613 is an equidigital number, since it uses as much as digits as its factorization.
200210112054613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 200210112054613 its reverse (316450211012002), we get a palindrome (516660323066615).
The spelling of 200210112054613 in words is "two hundred trillion, two hundred ten billion, one hundred twelve million, fifty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •