Base | Representation |
---|---|
bin | 1010001101010010001000… |
… | …0001010001011011100100 |
3 | 1110201221100111012111222001 |
4 | 2203110202001101123210 |
5 | 2432340324444201312 |
6 | 35511531104415044 |
7 | 2235600224351014 |
oct | 243244201213344 |
9 | 43657314174861 |
10 | 11223320303332 |
11 | 36378687a1175 |
12 | 13131a3317484 |
13 | 63547bc8b687 |
14 | 2ab2d68c1c44 |
15 | 146e2710d057 |
hex | a35220516e4 |
11223320303332 has 6 divisors (see below), whose sum is σ = 19640810530838. Its totient is φ = 5611660151664.
The previous prime is 11223320303243. The next prime is 11223320303339. The reversal of 11223320303332 is 23330302332211.
It can be written as a sum of positive squares in only one way, i.e., 9322848515556 + 1900471787776 = 3053334^2 + 1378576^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 11223320303332.
It is not an unprimeable number, because it can be changed into a prime (11223320303339) 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 as a sum of consecutive naturals, namely, 1402915037913 + ... + 1402915037920.
Almost surely, 211223320303332 is an apocalyptic number.
It is an amenable number.
11223320303332 is a deficient number, since it is larger than the sum of its proper divisors (8417490227506).
11223320303332 is a wasteful number, since it uses less digits than its factorization.
11223320303332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2805830075837 (or 2805830075835 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 11223320303332 its reverse (23330302332211), we get a palindrome (34553622635543).
The spelling of 11223320303332 in words is "eleven trillion, two hundred twenty-three billion, three hundred twenty million, three hundred three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •