Base | Representation |
---|---|
bin | 1011001011111101111011… |
… | …1010101101010011010111 |
3 | 1121112220001021020101220202 |
4 | 2302333132322231103113 |
5 | 3103011333203102221 |
6 | 42054352004451115 |
7 | 2406443124654653 |
oct | 262773672552327 |
9 | 47486037211822 |
10 | 12300231300311 |
11 | 3a125539a2489 |
12 | 1467a4a6a9a9b |
13 | 6b2ba3414586 |
14 | 30749772da63 |
15 | 164e55a6cd0b |
hex | b2fdeead4d7 |
12300231300311 has 4 divisors (see below), whose sum is σ = 12600236941824. Its totient is φ = 12000225658800.
The previous prime is 12300231300233. The next prime is 12300231300431. The reversal of 12300231300311 is 11300313200321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12300231300311 - 218 = 12300231038167 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 (12300231300011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 150002820695 + ... + 150002820776.
It is an arithmetic number, because the mean of its divisors is an integer number (3150059235456).
Almost surely, 212300231300311 is an apocalyptic number.
12300231300311 is a deficient number, since it is larger than the sum of its proper divisors (300005641513).
12300231300311 is an equidigital number, since it uses as much as digits as its factorization.
12300231300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300005641512.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 12300231300311 its reverse (11300313200321), we get a palindrome (23600544500632).
The spelling of 12300231300311 in words is "twelve trillion, three hundred billion, two hundred thirty-one million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •