Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110001001001001010101 |
3 | 222020212222120220021111212112 |
4 | 231201131001212021021111 |
5 | 202220224112230133023 |
6 | 1545451355241400405 |
7 | 60112524150356213 |
oct | 5541350146111125 |
9 | 866788526244775 |
10 | 200211001021013 |
11 | 5888001064a454 |
12 | 1a556297199105 |
13 | 8793a7c7a2338 |
14 | 376239ab9dcb3 |
15 | 1822e33205478 |
hex | b61741989255 |
200211001021013 has 4 divisors (see below), whose sum is σ = 200211966719520. Its totient is φ = 200210035322508.
The previous prime is 200211001020971. The next prime is 200211001021067. The reversal of 200211001021013 is 310120100112002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200211001021013 - 244 = 182618814976597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211001021613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 482538203 + ... + 482952936.
It is an arithmetic number, because the mean of its divisors is an integer number (50052991679880).
Almost surely, 2200211001021013 is an apocalyptic number.
It is an amenable number.
200211001021013 is a deficient number, since it is larger than the sum of its proper divisors (965698507).
200211001021013 is an equidigital number, since it uses as much as digits as its factorization.
200211001021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965698506.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 200211001021013 its reverse (310120100112002), we get a palindrome (510331101133015).
The spelling of 200211001021013 in words is "two hundred trillion, two hundred eleven billion, one million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •