Base | Representation |
---|---|
bin | 1011001101110001000010… |
… | …1111101001000101001111 |
3 | 1121122211210210102011221021 |
4 | 2303130100233221011033 |
5 | 3104013124300000221 |
6 | 42120502134415011 |
7 | 2411615642565502 |
oct | 263342057510517 |
9 | 47584723364837 |
10 | 12331132031311 |
11 | 3a24670617aa5 |
12 | 1471a33201467 |
13 | 6b5a8929a9a2 |
14 | 308b89645139 |
15 | 165b637ba041 |
hex | b3710be914f |
12331132031311 has 8 divisors (see below), whose sum is σ = 12394706307984. Its totient is φ = 12267672408000.
The previous prime is 12331132031261. The next prime is 12331132031327. The reversal of 12331132031311 is 11313023113321.
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 12331132031311 - 29 = 12331132030799 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 (12331132031341) 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, 28447680 + ... + 28877893.
It is an arithmetic number, because the mean of its divisors is an integer number (1549338288498).
Almost surely, 212331132031311 is an apocalyptic number.
12331132031311 is a deficient number, since it is larger than the sum of its proper divisors (63574276673).
12331132031311 is an equidigital number, since it uses as much as digits as its factorization.
12331132031311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57326681.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 12331132031311 its reverse (11313023113321), we get a palindrome (23644155144632).
The spelling of 12331132031311 in words is "twelve trillion, three hundred thirty-one billion, one hundred thirty-two million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •