Base | Representation |
---|---|
bin | 101101100001011101000010… |
… | …001101000011001010110111 |
3 | 222020212222121121110200110101 |
4 | 231201131002031003022313 |
5 | 202220224122333021101 |
6 | 1545451400244134531 |
7 | 60112524333145261 |
oct | 5541350215031267 |
9 | 866788547420411 |
10 | 200211011220151 |
11 | 58880016386198 |
12 | 1a55629a697447 |
13 | 8793a81933729 |
14 | 376239c296b31 |
15 | 1822e3406c401 |
hex | b617423432b7 |
200211011220151 has 2 divisors, whose sum is σ = 200211011220152. Its totient is φ = 200211011220150.
The previous prime is 200211011220109. The next prime is 200211011220167. The reversal of 200211011220151 is 151022110112002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200211011220151 - 27 = 200211011220023 is a prime.
It is a super-2 number, since 2×2002110112201512 (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 (200211011223151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105505610075 + 100105505610076.
It is an arithmetic number, because the mean of its divisors is an integer number (100105505610076).
Almost surely, 2200211011220151 is an apocalyptic number.
200211011220151 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211011220151 is an equidigital number, since it uses as much as digits as its factorization.
200211011220151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 200211011220151 its reverse (151022110112002), we get a palindrome (351233121332153).
The spelling of 200211011220151 in words is "two hundred trillion, two hundred eleven billion, eleven million, two hundred twenty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •