Base | Representation |
---|---|
bin | 110100001010001110… |
… | …0101001000000011011 |
3 | 101201010022201102121111 |
4 | 1220110130221000123 |
5 | 3313400110431021 |
6 | 123242510121151 |
7 | 11043524002423 |
oct | 1502434510033 |
9 | 351108642544 |
10 | 112012202011 |
11 | 4355aa71286 |
12 | 198607b01b7 |
13 | a741357198 |
14 | 55c8537483 |
15 | 2da8aba8e1 |
hex | 1a1472901b |
112012202011 has 4 divisors (see below), whose sum is σ = 112012876000. Its totient is φ = 112011528024.
The previous prime is 112012201979. The next prime is 112012202039. The reversal of 112012202011 is 110202210211.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 110202210211 = 229 ⋅481232359.
It is a cyclic number.
It is not a de Polignac number, because 112012202011 - 25 = 112012201979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112012201982 and 112012202000.
It is not an unprimeable number, because it can be changed into a prime (112012200011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 109390 + ... + 485788.
It is an arithmetic number, because the mean of its divisors is an integer number (28003219000).
Almost surely, 2112012202011 is an apocalyptic number.
112012202011 is a deficient number, since it is larger than the sum of its proper divisors (673989).
112012202011 is an equidigital number, since it uses as much as digits as its factorization.
112012202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673988.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112012202011 its reverse (110202210211), we get a palindrome (222214412222).
The spelling of 112012202011 in words is "one hundred twelve billion, twelve million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •