Base | Representation |
---|---|
bin | 11001011111100011111001… |
… | …010111100110110110011011 |
3 | 112200222120100021101210201202 |
4 | 121133203321113212312123 |
5 | 104143433240030310021 |
6 | 1034243115503504415 |
7 | 32421255240341003 |
oct | 3137437127466633 |
9 | 480876307353652 |
10 | 112120010010011 |
11 | 327a7913762833 |
12 | 106a97385b810b |
13 | 4a73b43b16173 |
14 | 1d988cd1c1003 |
15 | ce67734c1a0b |
hex | 65f8f95e6d9b |
112120010010011 has 4 divisors (see below), whose sum is σ = 112132575300792. Its totient is φ = 112107444719232.
The previous prime is 112120010009977. The next prime is 112120010010017. The reversal of 112120010010011 is 110010010021211.
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-112120010010011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112120010009974 and 112120010010001.
It is not an unprimeable number, because it can be changed into a prime (112120010010017) 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, 6282632006 + ... + 6282649851.
It is an arithmetic number, because the mean of its divisors is an integer number (28033143825198).
Almost surely, 2112120010010011 is an apocalyptic number.
112120010010011 is a deficient number, since it is larger than the sum of its proper divisors (12565290781).
112120010010011 is an equidigital number, since it uses as much as digits as its factorization.
112120010010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12565290780.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112120010010011 its reverse (110010010021211), we get a palindrome (222130020031222).
The spelling of 112120010010011 in words is "one hundred twelve trillion, one hundred twenty billion, ten million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •