Base | Representation |
---|---|
bin | 11001100001000001000001… |
… | …010011101110111101011011 |
3 | 112201100010102211110122200020 |
4 | 121201001001103232331123 |
5 | 104202103030301431021 |
6 | 1034401053514041523 |
7 | 32431425146423133 |
oct | 3141010123567533 |
9 | 481303384418606 |
10 | 112220001202011 |
11 | 3283626512229a |
12 | 10704ba34192a3 |
13 | 4a803ba860771 |
14 | 1d9d696dcbac3 |
15 | ce9176a6b7c6 |
hex | 6610414eef5b |
112220001202011 has 4 divisors (see below), whose sum is σ = 149626668269352. Its totient is φ = 74813334134672.
The previous prime is 112220001201953. The next prime is 112220001202013. The reversal of 112220001202011 is 110202100022211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112220001202011 - 29 = 112220001201499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112220001202013) 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 in 3 ways as a sum of consecutive naturals, for example, 18703333533666 + ... + 18703333533671.
It is an arithmetic number, because the mean of its divisors is an integer number (37406667067338).
Almost surely, 2112220001202011 is an apocalyptic number.
112220001202011 is a deficient number, since it is larger than the sum of its proper divisors (37406667067341).
112220001202011 is an equidigital number, since it uses as much as digits as its factorization.
112220001202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37406667067340.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112220001202011 its reverse (110202100022211), we get a palindrome (222422101224222).
The spelling of 112220001202011 in words is "one hundred twelve trillion, two hundred twenty billion, one million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •