Base | Representation |
---|---|
bin | 110010010010111000100100… |
… | …001001101100100100001001 |
3 | 1002000012111220011202111201220 |
4 | 302102320210021230210021 |
5 | 212443120111110401301 |
6 | 2102241514401432253 |
7 | 64410113336624526 |
oct | 6222704411544411 |
9 | 1060174804674656 |
10 | 221200012200201 |
11 | 6453244223a691 |
12 | 2098606463b689 |
13 | 96570c153c768 |
14 | 3c8a1cdc6414d |
15 | 1a88dbec20936 |
hex | c92e2426c909 |
221200012200201 has 8 divisors (see below), whose sum is σ = 295139741033280. Its totient is φ = 147363479083632.
The previous prime is 221200012200199. The next prime is 221200012200361. The reversal of 221200012200201 is 102002210002122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221200012200201 - 21 = 221200012200199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221200012204201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25798924125 + ... + 25798932698.
It is an arithmetic number, because the mean of its divisors is an integer number (36892467629160).
Almost surely, 2221200012200201 is an apocalyptic number.
It is an amenable number.
221200012200201 is a deficient number, since it is larger than the sum of its proper divisors (73939728833079).
221200012200201 is a wasteful number, since it uses less digits than its factorization.
221200012200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51597858255.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 221200012200201 its reverse (102002210002122), we get a palindrome (323202222202323).
The spelling of 221200012200201 in words is "two hundred twenty-one trillion, two hundred billion, twelve million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •