Base | Representation |
---|---|
bin | 1011101110000000110… |
… | …1110000110111010101 |
3 | 201020200001021211212212 |
4 | 2323200031300313111 |
5 | 11244311012400041 |
6 | 232253444523205 |
7 | 20355102315116 |
oct | 2734015606725 |
9 | 636601254785 |
10 | 201330200021 |
11 | 78424716165 |
12 | 330290b0505 |
13 | 15ca6a9c192 |
14 | 9a5ca2420d |
15 | 538512c8eb |
hex | 2ee0370dd5 |
201330200021 has 4 divisors (see below), whose sum is σ = 201429526272. Its totient is φ = 201230873772.
The previous prime is 201330199999. The next prime is 201330200129. The reversal of 201330200021 is 120002033102.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-201330200021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201330199969 and 201330200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201330200221) 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, 49660085 + ... + 49664138.
It is an arithmetic number, because the mean of its divisors is an integer number (50357381568).
Almost surely, 2201330200021 is an apocalyptic number.
It is an amenable number.
201330200021 is a deficient number, since it is larger than the sum of its proper divisors (99326251).
201330200021 is an equidigital number, since it uses as much as digits as its factorization.
201330200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99326250.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 201330200021 its reverse (120002033102), we get a palindrome (321332233123).
The spelling of 201330200021 in words is "two hundred one billion, three hundred thirty million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •