Base | Representation |
---|---|
bin | 10100100001111100… |
… | …00001010111100111 |
3 | 1001110011001022111221 |
4 | 22100332001113213 |
5 | 140033130042411 |
6 | 5021414041211 |
7 | 540065256664 |
oct | 122076012747 |
9 | 31404038457 |
10 | 11022112231 |
11 | 4746771069 |
12 | 2177349207 |
13 | 106869a300 |
14 | 767bc8a6b |
15 | 4479ab071 |
hex | 290f815e7 |
11022112231 has 24 divisors (see below), whose sum is σ = 12767860224. Its totient is φ = 9476812800.
The previous prime is 11022112229. The next prime is 11022112237. The reversal of 11022112231 is 13221122011.
11022112231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11022112231 - 21 = 11022112229 is a prime.
It is a super-2 number, since 2×110221122312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022112237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 258906 + ... + 298456.
It is an arithmetic number, because the mean of its divisors is an integer number (531994176).
Almost surely, 211022112231 is an apocalyptic number.
11022112231 is a deficient number, since it is larger than the sum of its proper divisors (1745747993).
11022112231 is a wasteful number, since it uses less digits than its factorization.
11022112231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39691 (or 39678 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11022112231 its reverse (13221122011), we get a palindrome (24243234242).
The spelling of 11022112231 in words is "eleven billion, twenty-two million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •