Base | Representation |
---|---|
bin | 1010000110001010110111… |
… | …0101101011010000000111 |
3 | 1110022020220120202120222222 |
4 | 2201202231311223100013 |
5 | 2423340034134201043 |
6 | 35335440325042555 |
7 | 2224012622165462 |
oct | 241425565532007 |
9 | 43266816676888 |
10 | 11101112022023 |
11 | 359aa56370681 |
12 | 12b3577b5645b |
13 | 626aa443349a |
14 | 2a54221842d9 |
15 | 143b73351d68 |
hex | a18add6b407 |
11101112022023 has 8 divisors (see below), whose sum is σ = 11600964173568. Its totient is φ = 10612245632184.
The previous prime is 11101112021969. The next prime is 11101112022031. The reversal of 11101112022023 is 32022021110111.
It is a happy number.
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 11101112022023 - 226 = 11101044913159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101112021992 and 11101112022010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101112022043) 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, 2746438361 + ... + 2746442402.
It is an arithmetic number, because the mean of its divisors is an integer number (1450120521696).
Almost surely, 211101112022023 is an apocalyptic number.
11101112022023 is a deficient number, since it is larger than the sum of its proper divisors (499852151545).
11101112022023 is an equidigital number, since it uses as much as digits as its factorization.
11101112022023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5492880853.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11101112022023 its reverse (32022021110111), we get a palindrome (43123133132134).
The spelling of 11101112022023 in words is "eleven trillion, one hundred one billion, one hundred twelve million, twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •