Base | Representation |
---|---|
bin | 11001011101110110000000… |
… | …101011101011100011001011 |
3 | 112200120021210102110202112120 |
4 | 121131312000223223203023 |
5 | 104140020114401041021 |
6 | 1034113003532142323 |
7 | 32406610331266512 |
oct | 3135660053534313 |
9 | 480507712422476 |
10 | 112002021112011 |
11 | 32761877038388 |
12 | 1068a8aa3079a3 |
13 | 4a6598c4924a4 |
14 | 1d92cd8dc3679 |
15 | ce3669d732c6 |
hex | 65dd80aeb8cb |
112002021112011 has 4 divisors (see below), whose sum is σ = 149336028149352. Its totient is φ = 74668014074672.
The previous prime is 112002021111973. The next prime is 112002021112169. The reversal of 112002021112011 is 110211120200211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112002021112011 is a prime.
It is a super-2 number, since 2×1120020211120112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112002021112211) 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, 18667003518666 + ... + 18667003518671.
It is an arithmetic number, because the mean of its divisors is an integer number (37334007037338).
Almost surely, 2112002021112011 is an apocalyptic number.
112002021112011 is a deficient number, since it is larger than the sum of its proper divisors (37334007037341).
112002021112011 is an equidigital number, since it uses as much as digits as its factorization.
112002021112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37334007037340.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112002021112011 its reverse (110211120200211), we get a palindrome (222213141312222).
The spelling of 112002021112011 in words is "one hundred twelve trillion, two billion, twenty-one million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •