Base | Representation |
---|---|
bin | 1010010010111011100001… |
… | …0001001010010010111011 |
3 | 1111002012202021200112200201 |
4 | 2210232320101022102323 |
5 | 2440433014031100243 |
6 | 40024253222143031 |
7 | 2245603224110656 |
oct | 244567021122273 |
9 | 44065667615621 |
10 | 11320330331323 |
11 | 3674a1a396022 |
12 | 1329b57881a77 |
13 | 64166c1b80c0 |
14 | 2b1c9a7ca89d |
15 | 149703ad504d |
hex | a4bb844a4bb |
11320330331323 has 16 divisors (see below), whose sum is σ = 12217041496800. Its totient is φ = 10427333918976.
The previous prime is 11320330331273. The next prime is 11320330331327. The reversal of 11320330331323 is 32313303302311.
It is not a de Polignac number, because 11320330331323 - 237 = 11182891377851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11320330331291 and 11320330331300.
It is not an unprimeable number, because it can be changed into a prime (11320330331327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21821436 + ... + 22334182.
It is an arithmetic number, because the mean of its divisors is an integer number (763565093550).
Almost surely, 211320330331323 is an apocalyptic number.
11320330331323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11320330331323 is a deficient number, since it is larger than the sum of its proper divisors (896711165477).
11320330331323 is a wasteful number, since it uses less digits than its factorization.
11320330331323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516366.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 11320330331323 its reverse (32313303302311), we get a palindrome (43633633633634).
The spelling of 11320330331323 in words is "eleven trillion, three hundred twenty billion, three hundred thirty million, three hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •