Base | Representation |
---|---|
bin | 1011001101101101010010… |
… | …0010110001010101101101 |
3 | 1121122202012101220111210020 |
4 | 2303123110202301111231 |
5 | 3104004042214234201 |
6 | 42120214014432353 |
7 | 2411551626635604 |
oct | 263332442612555 |
9 | 47582171814706 |
10 | 12330122024301 |
11 | 3a241a2489864 |
12 | 14717b0b026b9 |
13 | 6b5957c689c3 |
14 | 308ad1450a3b |
15 | 165b04cada36 |
hex | b36d48b156d |
12330122024301 has 8 divisors (see below), whose sum is σ = 16441254331104. Its totient is φ = 8219535533520.
The previous prime is 12330122024273. The next prime is 12330122024347. The reversal of 12330122024301 is 10342022103321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12330122024301 - 27 = 12330122024173 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12330122024351) 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, 136401291 + ... + 136491656.
It is an arithmetic number, because the mean of its divisors is an integer number (2055156791388).
Almost surely, 212330122024301 is an apocalyptic number.
It is an amenable number.
12330122024301 is a deficient number, since it is larger than the sum of its proper divisors (4111132306803).
12330122024301 is a wasteful number, since it uses less digits than its factorization.
12330122024301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272908011.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 12330122024301 its reverse (10342022103321), we get a palindrome (22672144127622).
The spelling of 12330122024301 in words is "twelve trillion, three hundred thirty billion, one hundred twenty-two million, twenty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •