Base | Representation |
---|---|
bin | 100010001000001111100111… |
… | …0010110010001101110110011 |
3 | 1110100220212012011122012222111 |
4 | 1010100133032112101232303 |
5 | 303321440002440201321 |
6 | 2542250022444350151 |
7 | 120142514556653056 |
oct | 10420371626215663 |
9 | 1410825164565874 |
10 | 300200201100211 |
11 | 87720210355245 |
12 | 29804987b45357 |
13 | cb679b02a4ca9 |
14 | 541baa5504a9d |
15 | 24a8d697a85e1 |
hex | 11107ce591bb3 |
300200201100211 has 4 divisors (see below), whose sum is σ = 300200658121800. Its totient is φ = 300199744078624.
The previous prime is 300200201100169. The next prime is 300200201100221. The reversal of 300200201100211 is 112001102002003.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 300200201100211 - 27 = 300200201100083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300200201100191 and 300200201100200.
It is not an unprimeable number, because it can be changed into a prime (300200201100221) 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, 227524081 + ... + 228839698.
It is an arithmetic number, because the mean of its divisors is an integer number (75050164530450).
Almost surely, 2300200201100211 is an apocalyptic number.
300200201100211 is a deficient number, since it is larger than the sum of its proper divisors (457021589).
300200201100211 is an equidigital number, since it uses as much as digits as its factorization.
300200201100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 457021588.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 300200201100211 its reverse (112001102002003), we get a palindrome (412201303102214).
The spelling of 300200201100211 in words is "three hundred trillion, two hundred billion, two hundred one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •