Base | Representation |
---|---|
bin | 1011101001110011101… |
… | …0111110101000101101 |
3 | 201010202100212211001112 |
4 | 2322130322332220231 |
5 | 11240003001432341 |
6 | 231545434321405 |
7 | 20315113066256 |
oct | 2723472765055 |
9 | 633670784045 |
10 | 200201202221 |
11 | 779a53a5429 |
12 | 32972b89265 |
13 | 15b56c07747 |
14 | 9992ad7b2d |
15 | 531ae69aeb |
hex | 2e9cebea2d |
200201202221 has 8 divisors (see below), whose sum is σ = 202734338304. Its totient is φ = 197678869200.
The previous prime is 200201202217. The next prime is 200201202233. The reversal of 200201202221 is 122202102002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200201202221 - 22 = 200201202217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200201202196 and 200201202205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201202251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2663465 + ... + 2737598.
It is an arithmetic number, because the mean of its divisors is an integer number (25341792288).
Almost surely, 2200201202221 is an apocalyptic number.
It is an amenable number.
200201202221 is a deficient number, since it is larger than the sum of its proper divisors (2533136083).
200201202221 is a wasteful number, since it uses less digits than its factorization.
200201202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5401531.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200201202221 its reverse (122202102002), we get a palindrome (322403304223).
The spelling of 200201202221 in words is "two hundred billion, two hundred one million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •