Base | Representation |
---|---|
bin | 110010000011000011011000… |
… | …101111000011111110100010 |
3 | 1001212100111212010000220202201 |
4 | 302003003120233003332202 |
5 | 212322304110232413442 |
6 | 2100050040112403414 |
7 | 64235401350331312 |
oct | 6203033057037642 |
9 | 1055314763026681 |
10 | 220112120201122 |
11 | 641530315a6a26 |
12 | 2082b25384656a |
13 | 95a863a0b1496 |
14 | 3c4d6aa88d442 |
15 | 1a6a94c2257b7 |
hex | c830d8bc3fa2 |
220112120201122 has 8 divisors (see below), whose sum is σ = 347545452949200. Its totient is φ = 104263635884724.
The previous prime is 220112120201093. The next prime is 220112120201131. The reversal of 220112120201122 is 221102021211022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 220112120201122.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 2896212107872 + ... + 2896212107947.
It is an arithmetic number, because the mean of its divisors is an integer number (43443181618650).
Almost surely, 2220112120201122 is an apocalyptic number.
220112120201122 is a deficient number, since it is larger than the sum of its proper divisors (127433332748078).
220112120201122 is a wasteful number, since it uses less digits than its factorization.
220112120201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5792424215840.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 220112120201122 its reverse (221102021211022), we get a palindrome (441214141412144).
The spelling of 220112120201122 in words is "two hundred twenty trillion, one hundred twelve billion, one hundred twenty million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •