Base | Representation |
---|---|
bin | 1011001101101110000001… |
… | …0110000110111001001111 |
3 | 1121122202201012111022100012 |
4 | 2303123200112012321033 |
5 | 3104004443412000221 |
6 | 42120245410423435 |
7 | 2411556552652532 |
oct | 263334026067117 |
9 | 47582635438305 |
10 | 12330320031311 |
11 | 3a24294230417 |
12 | 1471847291b7b |
13 | 6b5989ca5b09 |
14 | 308b0d874a19 |
15 | 165b1737265b |
hex | b36e0586e4f |
12330320031311 has 8 divisors (see below), whose sum is σ = 12529560491904. Its totient is φ = 12131526801240.
The previous prime is 12330320031233. The next prime is 12330320031461. The reversal of 12330320031311 is 11313002303321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12330320031311 - 238 = 12055442124367 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12330320036311) 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 7 ways as a sum of consecutive naturals, for example, 111752045 + ... + 111862326.
It is an arithmetic number, because the mean of its divisors is an integer number (1566195061488).
Almost surely, 212330320031311 is an apocalyptic number.
12330320031311 is a deficient number, since it is larger than the sum of its proper divisors (199240460593).
12330320031311 is an equidigital number, since it uses as much as digits as its factorization.
12330320031311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223615261.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 12330320031311 its reverse (11313002303321), we get a palindrome (23643322334632).
The spelling of 12330320031311 in words is "twelve trillion, three hundred thirty billion, three hundred twenty million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •