Base | Representation |
---|---|
bin | 10100111001101011… |
… | …11001111000101111 |
3 | 1001222000212122212222 |
4 | 22130311321320233 |
5 | 140440123423043 |
6 | 5053251345555 |
7 | 545034366326 |
oct | 123465717057 |
9 | 31860778788 |
10 | 11221311023 |
11 | 483915706a |
12 | 2211bb22bb |
13 | 109aa33a10 |
14 | 78643d0bd |
15 | 45a207d68 |
hex | 29cd79e2f |
11221311023 has 16 divisors (see below), whose sum is σ = 13468785120. Its totient is φ = 9235731456.
The previous prime is 11221311007. The next prime is 11221311071. The reversal of 11221311023 is 32011312211.
It is a cyclic number.
It is not a de Polignac number, because 11221311023 - 24 = 11221311007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a zygodrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 11221310992 and 11221311010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221311923) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1331990 + ... + 1340387.
It is an arithmetic number, because the mean of its divisors is an integer number (841799070).
Almost surely, 211221311023 is an apocalyptic number.
11221311023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11221311023 is a deficient number, since it is larger than the sum of its proper divisors (2247474097).
11221311023 is a wasteful number, since it uses less digits than its factorization.
11221311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2672426.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11221311023 its reverse (32011312211), we get a palindrome (43232623234).
The spelling of 11221311023 in words is "eleven billion, two hundred twenty-one million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •