Base | Representation |
---|---|
bin | 1011101101100101110… |
… | …0000010000111111101 |
3 | 201020101010100022002011 |
4 | 2323121130002013331 |
5 | 11244042411001341 |
6 | 232234303531221 |
7 | 20352222013612 |
oct | 2733134020775 |
9 | 636333308064 |
10 | 201216500221 |
11 | 78376517890 |
12 | 32bb6bb9b11 |
13 | 15c8936caa9 |
14 | 9a4b8a8509 |
15 | 537a16db81 |
hex | 2ed97021fd |
201216500221 has 4 divisors (see below), whose sum is σ = 219508909344. Its totient is φ = 182924091100.
The previous prime is 201216500179. The next prime is 201216500231. The reversal of 201216500221 is 122005612102.
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 not a de Polignac number, because 201216500221 - 29 = 201216499709 is a prime.
It is a super-2 number, since 2×2012165002212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201216500192 and 201216500201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201216500231) 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, 9146204545 + ... + 9146204566.
It is an arithmetic number, because the mean of its divisors is an integer number (54877227336).
Almost surely, 2201216500221 is an apocalyptic number.
It is an amenable number.
201216500221 is a deficient number, since it is larger than the sum of its proper divisors (18292409123).
201216500221 is a wasteful number, since it uses less digits than its factorization.
201216500221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18292409122.
The product of its (nonzero) digits is 480, while the sum is 22.
The spelling of 201216500221 in words is "two hundred one billion, two hundred sixteen million, five hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •