Base | Representation |
---|---|
bin | 101101100001100110100001… |
… | …101011100110101101000011 |
3 | 222020220221220220002202020222 |
4 | 231201212201223212231003 |
5 | 202220411010432001011 |
6 | 1545500203441253255 |
7 | 60113335026640445 |
oct | 5541464153465503 |
9 | 866827826082228 |
10 | 200221203000131 |
11 | 58884376379355 |
12 | 1a55826393422b |
13 | 8794a1728a881 |
14 | 3762a87a9c495 |
15 | 182332dbadddb |
hex | b619a1ae6b43 |
200221203000131 has 2 divisors, whose sum is σ = 200221203000132. Its totient is φ = 200221203000130.
The previous prime is 200221203000101. The next prime is 200221203000239. The reversal of 200221203000131 is 131000302122002.
200221203000131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200221203000131 - 230 = 200220129258307 is a prime.
It is a super-2 number, since 2×2002212030001312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200221203000101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110601500065 + 100110601500066.
It is an arithmetic number, because the mean of its divisors is an integer number (100110601500066).
Almost surely, 2200221203000131 is an apocalyptic number.
200221203000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
200221203000131 is an equidigital number, since it uses as much as digits as its factorization.
200221203000131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 200221203000131 its reverse (131000302122002), we get a palindrome (331221505122133).
The spelling of 200221203000131 in words is "two hundred trillion, two hundred twenty-one billion, two hundred three million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •