Base | Representation |
---|---|
bin | 1011001101101110000001… |
… | …1001111010101111101001 |
3 | 1121122202201021101001110011 |
4 | 2303123200121322233221 |
5 | 3104004444140430441 |
6 | 42120245444051521 |
7 | 2411556564312523 |
oct | 263334031725751 |
9 | 47582637331404 |
10 | 12330321030121 |
11 | 3a24294852886 |
12 | 1471847693ba1 |
13 | 6b598a265623 |
14 | 308b0da54a13 |
15 | 165b174bd581 |
hex | b36e067abe9 |
12330321030121 has 8 divisors (see below), whose sum is σ = 12696637123584. Its totient is φ = 11965745156400.
The previous prime is 12330321030019. The next prime is 12330321030187. The reversal of 12330321030121 is 12103012303321.
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 12330321030121 - 27 = 12330321029993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12330321030092 and 12330321030101.
It is not an unprimeable number, because it can be changed into a prime (12330321031121) 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, 435040555 + ... + 435068896.
It is an arithmetic number, because the mean of its divisors is an integer number (1587079640448).
Almost surely, 212330321030121 is an apocalyptic number.
It is an amenable number.
12330321030121 is a deficient number, since it is larger than the sum of its proper divisors (366316093463).
12330321030121 is an equidigital number, since it uses as much as digits as its factorization.
12330321030121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 870109871.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12330321030121 its reverse (12103012303321), we get a palindrome (24433333333442).
The spelling of 12330321030121 in words is "twelve trillion, three hundred thirty billion, three hundred twenty-one million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •