Base | Representation |
---|---|
bin | 101101100001011101010100… |
… | …100111011100111100010101 |
3 | 222020220000102010201222221212 |
4 | 231201131110213130330111 |
5 | 202220230240423200344 |
6 | 1545451451041151205 |
7 | 60112535103641102 |
oct | 5541352447347425 |
9 | 866800363658855 |
10 | 200211320131349 |
11 | 588801647967aa |
12 | 1a55636602b505 |
13 | 8793b00931617 |
14 | 37623cb309aa9 |
15 | 1822e5123b79e |
hex | b617549dcf15 |
200211320131349 has 2 divisors, whose sum is σ = 200211320131350. Its totient is φ = 200211320131348.
The previous prime is 200211320131231. The next prime is 200211320131373. The reversal of 200211320131349 is 943131023112002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 173406574202449 + 26804745928900 = 13168393^2 + 5177330^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211320131349 - 220 = 200211319082773 is a prime.
It is a super-2 number, since 2×2002113201313492 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200211320136349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105660065674 + 100105660065675.
It is an arithmetic number, because the mean of its divisors is an integer number (100105660065675).
Almost surely, 2200211320131349 is an apocalyptic number.
It is an amenable number.
200211320131349 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211320131349 is an equidigital number, since it uses as much as digits as its factorization.
200211320131349 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 200211320131349 in words is "two hundred trillion, two hundred eleven billion, three hundred twenty million, one hundred thirty-one thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •