Base | Representation |
---|---|
bin | 1010111011001100100110… |
… | …1111011111100111110001 |
3 | 1120112100100211020221221111 |
4 | 2232303021233133213301 |
5 | 3033301301441332241 |
6 | 41314142202353321 |
7 | 2346563235533551 |
oct | 256631157374761 |
9 | 46470324227844 |
10 | 12012113230321 |
11 | 3911343844056 |
12 | 14200404bb841 |
13 | 69197814aba9 |
14 | 2d7564673161 |
15 | 15c6e15aac81 |
hex | aecc9bdf9f1 |
12012113230321 has 8 divisors (see below), whose sum is σ = 12156954312384. Its totient is φ = 11867274930000.
The previous prime is 12012113230319. The next prime is 12012113230331. The reversal of 12012113230321 is 12303231121021.
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 12012113230321 - 21 = 12012113230319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12012113230292 and 12012113230301.
It is not an unprimeable number, because it can be changed into a prime (12012113230301) 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, 8764071 + ... + 10041571.
It is an arithmetic number, because the mean of its divisors is an integer number (1519619289048).
Almost surely, 212012113230321 is an apocalyptic number.
It is an amenable number.
12012113230321 is a deficient number, since it is larger than the sum of its proper divisors (144841082063).
12012113230321 is a wasteful number, since it uses less digits than its factorization.
12012113230321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1390871.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12012113230321 its reverse (12303231121021), we get a palindrome (24315344351342).
The spelling of 12012113230321 in words is "twelve trillion, twelve billion, one hundred thirteen million, two hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •