Base | Representation |
---|---|
bin | 11001011101111110011111… |
… | …000001010000101000101011 |
3 | 112200121011021112200011211011 |
4 | 121131332133001100220223 |
5 | 104140142233211120021 |
6 | 1034121110445244351 |
7 | 32410351654604212 |
oct | 3135763701205053 |
9 | 480534245604734 |
10 | 112011120020011 |
11 | 32765716144663 |
12 | 106906095636b7 |
13 | 4a667ac593214 |
14 | 1d9351d5c4079 |
15 | ce39eda8ade1 |
hex | 65df9f050a2b |
112011120020011 has 4 divisors (see below), whose sum is σ = 112017312261000. Its totient is φ = 112004927779024.
The previous prime is 112011120019987. The next prime is 112011120020069. The reversal of 112011120020011 is 110020021110211.
It is a happy number.
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 112011120020011 - 25 = 112011120019979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112011120019973 and 112011120020000.
It is not an unprimeable number, because it can be changed into a prime (112011120027011) 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, 3096093361 + ... + 3096129538.
It is an arithmetic number, because the mean of its divisors is an integer number (28004328065250).
Almost surely, 2112011120020011 is an apocalyptic number.
112011120020011 is a deficient number, since it is larger than the sum of its proper divisors (6192240989).
112011120020011 is an equidigital number, since it uses as much as digits as its factorization.
112011120020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6192240988.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112011120020011 its reverse (110020021110211), we get a palindrome (222031141130222).
The spelling of 112011120020011 in words is "one hundred twelve trillion, eleven billion, one hundred twenty million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •