Base | Representation |
---|---|
bin | 101101101110011011000001… |
… | …111010111111111011101100 |
3 | 222101001011221221100100020201 |
4 | 231232123001322333323230 |
5 | 202324324312310432340 |
6 | 1551413025250123244 |
7 | 60234104201412310 |
oct | 5556330172777354 |
9 | 871034857310221 |
10 | 201102212202220 |
11 | 59093a7307863a |
12 | 1a67ab57b80524 |
13 | 8829b1b47b844 |
14 | 3793582c23b40 |
15 | 183b1e3d6c79a |
hex | b6e6c1ebfeec |
201102212202220 has 48 divisors (see below), whose sum is σ = 482769415840320. Its totient is φ = 68931600390144.
The previous prime is 201102212202217. The next prime is 201102212202293. The reversal of 201102212202220 is 22202212201102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 184135969 + ... + 185224888.
It is an arithmetic number, because the mean of its divisors is an integer number (10057696163340).
Almost surely, 2201102212202220 is an apocalyptic number.
201102212202220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201102212202220 is an abundant number, since it is smaller than the sum of its proper divisors (281667203638100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102212202220 is a wasteful number, since it uses less digits than its factorization.
201102212202220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 369364762 (or 369364760 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 201102212202220 its reverse (22202212201102), we get a palindrome (223304424403322).
The spelling of 201102212202220 in words is "two hundred one trillion, one hundred two billion, two hundred twelve million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •