Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …011010001011101100111 |
3 | 10220011212022112010222000 |
4 | 100000222103101131213 |
5 | 121011223124314421 |
6 | 2201233521140343 |
7 | 142326336641301 |
oct | 20005223213547 |
9 | 3804768463860 |
10 | 1100221323111 |
11 | 394668288359 |
12 | 159291a8a6b3 |
13 | 7c99a8b9cb1 |
14 | 3b372a3a971 |
15 | 1d94511d226 |
hex | 1002a4d1767 |
1100221323111 has 8 divisors (see below), whose sum is σ = 1629957515760. Its totient is φ = 733480882056.
The previous prime is 1100221323109. The next prime is 1100221323139. The reversal of 1100221323111 is 1113231220011.
1100221323111 is a `hidden beast` number, since 1 + 10 + 0 + 221 + 323 + 111 = 666.
It is not a de Polignac number, because 1100221323111 - 21 = 1100221323109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100221323101) 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 7 ways as a sum of consecutive naturals, for example, 20374468920 + ... + 20374468973.
It is an arithmetic number, because the mean of its divisors is an integer number (203744689470).
Almost surely, 21100221323111 is an apocalyptic number.
1100221323111 is a deficient number, since it is larger than the sum of its proper divisors (529736192649).
1100221323111 is an equidigital number, since it uses as much as digits as its factorization.
1100221323111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40748937902 (or 40748937896 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1100221323111 its reverse (1113231220011), we get a palindrome (2213452543122).
The spelling of 1100221323111 in words is "one trillion, one hundred billion, two hundred twenty-one million, three hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •