Base | Representation |
---|---|
bin | 101101100001011100000101… |
… | …111011100011100100110011 |
3 | 222020212220000010200110000111 |
4 | 231201130011323203210303 |
5 | 202220220040000020311 |
6 | 1545451112042202151 |
7 | 60112460304010405 |
oct | 5541340573434463 |
9 | 866786003613014 |
10 | 200210000001331 |
11 | 5887a64759a561 |
12 | 1a556057ab3357 |
13 | 8793950298cb8 |
14 | 3762303c68b75 |
15 | 1822dc53c1d21 |
hex | b61705ee3933 |
200210000001331 has 4 divisors (see below), whose sum is σ = 200270141188200. Its totient is φ = 200149858814464.
The previous prime is 200210000001317. The next prime is 200210000001371. The reversal of 200210000001331 is 133100000012002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200210000001331 is a prime.
It is a super-2 number, since 2×2002100000013312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200210000001371) 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, 30070588441 + ... + 30070595098.
It is an arithmetic number, because the mean of its divisors is an integer number (50067535297050).
Almost surely, 2200210000001331 is an apocalyptic number.
200210000001331 is a deficient number, since it is larger than the sum of its proper divisors (60141186869).
200210000001331 is an equidigital number, since it uses as much as digits as its factorization.
200210000001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60141186868.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 200210000001331 its reverse (133100000012002), we get a palindrome (333310000013333).
The spelling of 200210000001331 in words is "two hundred trillion, two hundred ten billion, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •