Base | Representation |
---|---|
bin | 101101100011000010110100… |
… | …010101110110000111100011 |
3 | 222021021102201011011201211022 |
4 | 231203002310111312013203 |
5 | 202224021433334423021 |
6 | 1550013513040440055 |
7 | 60123443533120316 |
oct | 5543026425660743 |
9 | 867242634151738 |
10 | 200320300311011 |
11 | 589123a9205791 |
12 | 1a5734bb31902b |
13 | 87a117aa7192a |
14 | 37677a8ca297d |
15 | 1825bcda3a1ab |
hex | b630b45761e3 |
200320300311011 has 2 divisors, whose sum is σ = 200320300311012. Its totient is φ = 200320300311010.
The previous prime is 200320300310987. The next prime is 200320300311017. The reversal of 200320300311011 is 110113003023002.
200320300311011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200320300311011 is a prime.
It is a super-4 number, since 4×2003203003110114 (a number of 58 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (200320300311017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100160150155505 + 100160150155506.
It is an arithmetic number, because the mean of its divisors is an integer number (100160150155506).
Almost surely, 2200320300311011 is an apocalyptic number.
200320300311011 is a deficient number, since it is larger than the sum of its proper divisors (1).
200320300311011 is an equidigital number, since it uses as much as digits as its factorization.
200320300311011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 200320300311011 its reverse (110113003023002), we get a palindrome (310433303334013).
The spelling of 200320300311011 in words is "two hundred trillion, three hundred twenty billion, three hundred million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •