Base | Representation |
---|---|
bin | 1010010011100100011011… |
… | …1001000110110111110010 |
3 | 1111010021002200201010011222 |
4 | 2210321012321012313302 |
5 | 2441123012123233242 |
6 | 40033311113105042 |
7 | 2246442334115333 |
oct | 244710671066762 |
9 | 44107080633158 |
10 | 11331313102322 |
11 | 3679645926474 |
12 | 13301019b8182 |
13 | 6426cc68c675 |
14 | 2b261d29428a |
15 | 149b47dbe5d2 |
hex | a4e46e46df2 |
11331313102322 has 4 divisors (see below), whose sum is σ = 16996969653486. Its totient is φ = 5665656551160.
The previous prime is 11331313102309. The next prime is 11331313102331. The reversal of 11331313102322 is 22320131313311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 10159461386881 + 1171851715441 = 3187391^2 + 1082521^2 .
It is a super-3 number, since 3×113313131023223 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11331313102291 and 11331313102300.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 2832828275579 + ... + 2832828275582.
Almost surely, 211331313102322 is an apocalyptic number.
11331313102322 is a deficient number, since it is larger than the sum of its proper divisors (5665656551164).
11331313102322 is an equidigital number, since it uses as much as digits as its factorization.
11331313102322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5665656551163.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 11331313102322 its reverse (22320131313311), we get a palindrome (33651444415633).
The spelling of 11331313102322 in words is "eleven trillion, three hundred thirty-one billion, three hundred thirteen million, one hundred two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •