Base | Representation |
---|---|
bin | 101101101110011010110110… |
… | …100010000101000011011101 |
3 | 222101001011110121210101000122 |
4 | 231232122312202011003131 |
5 | 202324323414401321341 |
6 | 1551412554302404325 |
7 | 60234066361300034 |
oct | 5556326642050335 |
9 | 871034417711018 |
10 | 201102021120221 |
11 | 59093985226931 |
12 | 1a67ab03b906a5 |
13 | 8829aba9c7780 |
14 | 37935656c371b |
15 | 183b1d21c594b |
hex | b6e6b68850dd |
201102021120221 has 16 divisors (see below), whose sum is σ = 216696621216768. Its totient is φ = 185525339803200.
The previous prime is 201102021120181. The next prime is 201102021120233. The reversal of 201102021120221 is 122021120201102.
It is a cyclic number.
It is not a de Polignac number, because 201102021120221 - 246 = 130733276942557 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201102021120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102021120241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 155453750 + ... + 156742056.
It is an arithmetic number, because the mean of its divisors is an integer number (13543538826048).
Almost surely, 2201102021120221 is an apocalyptic number.
It is an amenable number.
201102021120221 is a deficient number, since it is larger than the sum of its proper divisors (15594600096547).
201102021120221 is a wasteful number, since it uses less digits than its factorization.
201102021120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295252.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 201102021120221 its reverse (122021120201102), we get a palindrome (323123141321323).
The spelling of 201102021120221 in words is "two hundred one trillion, one hundred two billion, twenty-one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •