Base | Representation |
---|---|
bin | 1011001011111101001100… |
… | …0011101100110101110001 |
3 | 1121112212112101211201111111 |
4 | 2302333103003230311301 |
5 | 3103010431234043441 |
6 | 42054320140113321 |
7 | 2406435160522603 |
oct | 262772303546561 |
9 | 47485471751444 |
10 | 12300032331121 |
11 | 3a12461653a37 |
12 | 14679b3b35841 |
13 | 6b2b7112b522 |
14 | 307479139173 |
15 | 164e43369081 |
hex | b2fd30ecd71 |
12300032331121 has 8 divisors (see below), whose sum is σ = 12468967814144. Its totient is φ = 12131108791200.
The previous prime is 12300032331073. The next prime is 12300032331143. The reversal of 12300032331121 is 12113323000321.
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 12300032331121 - 211 = 12300032329073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12300032331092 and 12300032331101.
It is not an unprimeable number, because it can be changed into a prime (12300032331721) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 901941 + ... + 5041186.
It is an arithmetic number, because the mean of its divisors is an integer number (1558620976768).
Almost surely, 212300032331121 is an apocalyptic number.
It is an amenable number.
12300032331121 is a deficient number, since it is larger than the sum of its proper divisors (168935483023).
12300032331121 is an equidigital number, since it uses as much as digits as its factorization.
12300032331121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5971551.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12300032331121 its reverse (12113323000321), we get a palindrome (24413355331442).
The spelling of 12300032331121 in words is "twelve trillion, three hundred billion, thirty-two million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •