Base | Representation |
---|---|
bin | 11001100001000001001101… |
… | …001010000110001010100011 |
3 | 112201100010221200112202021121 |
4 | 121201001031022012022203 |
5 | 104202103432200032321 |
6 | 1034401125335033111 |
7 | 32431433112252430 |
oct | 3141011512061243 |
9 | 481303850482247 |
10 | 112220200002211 |
11 | 32836357365884 |
12 | 10705039b0b797 |
13 | 4a8041cab7912 |
14 | 1d9d6b557ab87 |
15 | ce918923a441 |
hex | 66104d2862a3 |
112220200002211 has 8 divisors (see below), whose sum is σ = 128251785888864. Its totient is φ = 96188646301440.
The previous prime is 112220200002193. The next prime is 112220200002241. The reversal of 112220200002211 is 112200002022211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112220200002211 - 215 = 112220199969443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112220200002241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44620 + ... + 14981401.
It is an arithmetic number, because the mean of its divisors is an integer number (16031473236108).
Almost surely, 2112220200002211 is an apocalyptic number.
112220200002211 is a deficient number, since it is larger than the sum of its proper divisors (16031585886653).
112220200002211 is a wasteful number, since it uses less digits than its factorization.
112220200002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16092941.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 112220200002211 its reverse (112200002022211), we get a palindrome (224420202024422).
It can be divided in two parts, 11222020000 and 2211, that added together give a palindrome (11222022211).
The spelling of 112220200002211 in words is "one hundred twelve trillion, two hundred twenty billion, two hundred million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •