Base | Representation |
---|---|
bin | 101101101110011001000101… |
… | …010110010110101001000010 |
3 | 222101000222120021200022011101 |
4 | 231232121011112112221002 |
5 | 202324311022242033442 |
6 | 1551412042030405014 |
7 | 60234001333024045 |
oct | 5556310526265102 |
9 | 871028507608141 |
10 | 201100122221122 |
11 | 590930a0362933 |
12 | 1a67a67406076a |
13 | 882987748b037 |
14 | 3793425424c5c |
15 | 183b120633cb7 |
hex | b6e645596a42 |
201100122221122 has 4 divisors (see below), whose sum is σ = 301650183331686. Its totient is φ = 100550061110560.
The previous prime is 201100122221099. The next prime is 201100122221129. The reversal of 201100122221122 is 221122221001102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 182298090171961 + 18802032049161 = 13501781^2 + 4336131^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 201100122221122.
It is not an unprimeable number, because it can be changed into a prime (201100122221129) 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 as a sum of consecutive naturals, namely, 50275030555279 + ... + 50275030555282.
Almost surely, 2201100122221122 is an apocalyptic number.
201100122221122 is a deficient number, since it is larger than the sum of its proper divisors (100550061110564).
201100122221122 is a wasteful number, since it uses less digits than its factorization.
201100122221122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100550061110563.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 201100122221122 its reverse (221122221001102), we get a palindrome (422222343222224).
The spelling of 201100122221122 in words is "two hundred one trillion, one hundred billion, one hundred twenty-two million, two hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •