Base | Representation |
---|---|
bin | 11001000010011111001101… |
… | …110110000011100111011011 |
3 | 112102220120102212212122122112 |
4 | 121002133031312003213123 |
5 | 103413220100210031021 |
6 | 1030113223055142535 |
7 | 32124026535434045 |
oct | 3102371566034733 |
9 | 472816385778575 |
10 | 110122120002011 |
11 | 320a758a955197 |
12 | 104264a3214a4b |
13 | 495a61875a990 |
14 | 1d29d20a5ca95 |
15 | cae7e0881d5b |
hex | 6427cdd839db |
110122120002011 has 8 divisors (see below), whose sum is σ = 123749271975840. Its totient is φ = 97231570837632.
The previous prime is 110122120001981. The next prime is 110122120002047. The reversal of 110122120002011 is 110200021221011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110122120002011 - 222 = 110122115807707 is a prime.
It is a super-2 number, since 2×1101221200020112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110122120002511) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184150702046 + ... + 184150702643.
It is an arithmetic number, because the mean of its divisors is an integer number (15468658996980).
Almost surely, 2110122120002011 is an apocalyptic number.
110122120002011 is a deficient number, since it is larger than the sum of its proper divisors (13627151973829).
110122120002011 is a wasteful number, since it uses less digits than its factorization.
110122120002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 368301404725.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110122120002011 its reverse (110200021221011), we get a palindrome (220322141223022).
The spelling of 110122120002011 in words is "one hundred ten trillion, one hundred twenty-two billion, one hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •