Base | Representation |
---|---|
bin | 1010000000010110101111… |
… | …1011100011101110110111 |
3 | 1102221201002002002201122021 |
4 | 2200011223323203232313 |
5 | 2420221000314120043 |
6 | 35221520331414011 |
7 | 2213545352163034 |
oct | 240055373435667 |
9 | 42851062081567 |
10 | 11001222020023 |
11 | 3561657035714 |
12 | 129813abb4307 |
13 | 61a545658221 |
14 | 2a066799838b |
15 | 141278ae43ed |
hex | a016bee3bb7 |
11001222020023 has 32 divisors (see below), whose sum is σ = 11250627379200. Its totient is φ = 10755250178400.
The previous prime is 11001222019993. The next prime is 11001222020027. The reversal of 11001222020023 is 32002022210011.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001222020023 is a prime.
It is a super-2 number, since 2×110012220200232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11001222019979 and 11001222020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001222020027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3133356838 + ... + 3133360348.
It is an arithmetic number, because the mean of its divisors is an integer number (351582105600).
Almost surely, 211001222020023 is an apocalyptic number.
11001222020023 is a deficient number, since it is larger than the sum of its proper divisors (249405359177).
11001222020023 is a wasteful number, since it uses less digits than its factorization.
11001222020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4723.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 11001222020023 its reverse (32002022210011), we get a palindrome (43003244230034).
The spelling of 11001222020023 in words is "eleven trillion, one billion, two hundred twenty-two million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •