Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …110000011011111111101011 |
3 | 112102212111202202020021222111 |
4 | 121002110313300123333223 |
5 | 103413024323033341021 |
6 | 1030104144532303151 |
7 | 32123154345200413 |
oct | 3102246760337753 |
9 | 472774682207874 |
10 | 110111012012011 |
11 | 320a28aa76896a |
12 | 10424303171ab7 |
13 | 4959568352b2a |
14 | 1d295896bb643 |
15 | cae3905b08e1 |
hex | 642537c1bfeb |
110111012012011 has 2 divisors, whose sum is σ = 110111012012012. Its totient is φ = 110111012012010.
The previous prime is 110111012011991. The next prime is 110111012012107. The reversal of 110111012012011 is 110210210111011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110111012012011 - 27 = 110111012011883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110111012011982 and 110111012012000.
It is not a weakly prime, because it can be changed into another prime (110111012012311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055506006005 + 55055506006006.
It is an arithmetic number, because the mean of its divisors is an integer number (55055506006006).
Almost surely, 2110111012012011 is an apocalyptic number.
110111012012011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111012012011 is an equidigital number, since it uses as much as digits as its factorization.
110111012012011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110111012012011 its reverse (110210210111011), we get a palindrome (220321222123022).
The spelling of 110111012012011 in words is "one hundred ten trillion, one hundred eleven billion, twelve million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •