Base | Representation |
---|---|
bin | 1010010001111011011001… |
… | …1101110110001101101001 |
3 | 1111000120022212211222111121 |
4 | 2210132312131312031221 |
5 | 2440142242234431241 |
6 | 40012325354055241 |
7 | 2244423566514100 |
oct | 244366635661551 |
9 | 44016285758447 |
10 | 11303120233321 |
11 | 3668698777734 |
12 | 132675411a521 |
13 | 63cb58813367 |
14 | 2b1106c5b037 |
15 | 149047c5bad1 |
hex | a47b6776369 |
11303120233321 has 12 divisors (see below), whose sum is σ = 13162560251988. Its totient is φ = 9678048936192.
The previous prime is 11303120233297. The next prime is 11303120233357. The reversal of 11303120233321 is 12333202130311.
It can be written as a sum of positive squares in 2 ways, for example, as 2732342880400 + 8570777352921 = 1652980^2 + 2927589^2 .
It is not a de Polignac number, because 11303120233321 - 27 = 11303120233193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11303120233021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 123046896 + ... + 123138721.
It is an arithmetic number, because the mean of its divisors is an integer number (1096880020999).
Almost surely, 211303120233321 is an apocalyptic number.
It is an amenable number.
11303120233321 is a deficient number, since it is larger than the sum of its proper divisors (1859440018667).
11303120233321 is an equidigital number, since it uses as much as digits as its factorization.
11303120233321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246186568 (or 246186561 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 11303120233321 its reverse (12333202130311), we get a palindrome (23636322363632).
The spelling of 11303120233321 in words is "eleven trillion, three hundred three billion, one hundred twenty million, two hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •