Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101101101001100111 |
3 | 1111010020122000200021212010 |
4 | 2210320330003231221213 |
5 | 2441122124110130343 |
6 | 40033241101125303 |
7 | 2246434666111302 |
oct | 244707403555147 |
9 | 44106560607763 |
10 | 11331131333223 |
11 | 3679562265679 |
12 | 1330070b59833 |
13 | 6426a0b194a0 |
14 | 2b2603099b39 |
15 | 149b36e66d33 |
hex | a4e3c0eda67 |
11331131333223 has 16 divisors (see below), whose sum is σ = 16270555392000. Its totient is φ = 6972912626784.
The previous prime is 11331131333209. The next prime is 11331131333243. The reversal of 11331131333223 is 32233313113311.
It is not a de Polignac number, because 11331131333223 - 29 = 11331131332711 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331131333243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1179490 + ... + 4904432.
It is an arithmetic number, because the mean of its divisors is an integer number (1016909712000).
Almost surely, 211331131333223 is an apocalyptic number.
11331131333223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11331131333223 is a deficient number, since it is larger than the sum of its proper divisors (4939424058777).
11331131333223 is a wasteful number, since it uses less digits than its factorization.
11331131333223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3802958.
The product of its digits is 8748, while the sum is 30.
Adding to 11331131333223 its reverse (32233313113311), we get a palindrome (43564444446534).
The spelling of 11331131333223 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •