Base | Representation |
---|---|
bin | 1011001101110101011110… |
… | …1100001010100010100001 |
3 | 1121122221212202010012112001 |
4 | 2303131113230022202201 |
5 | 3104023044002131423 |
6 | 42121220214204001 |
7 | 2411660304662662 |
oct | 263352754124241 |
9 | 47587782105461 |
10 | 12332322302113 |
11 | 3a25121489080 |
12 | 1472105953601 |
13 | 6b5c18a66938 |
14 | 308c5d761369 |
15 | 165bd3032cad |
hex | b3757b0a8a1 |
12332322302113 has 16 divisors (see below), whose sum is σ = 13616130124800. Its totient is φ = 11075640947280.
The previous prime is 12332322302089. The next prime is 12332322302173. The reversal of 12332322302113 is 31120322323321.
It is a happy number.
12332322302113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12332322302113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12332322302173) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21370708 + ... + 21940186.
It is an arithmetic number, because the mean of its divisors is an integer number (851008132800).
Almost surely, 212332322302113 is an apocalyptic number.
It is an amenable number.
12332322302113 is a deficient number, since it is larger than the sum of its proper divisors (1283807822687).
12332322302113 is a wasteful number, since it uses less digits than its factorization.
12332322302113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 593292.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 12332322302113 its reverse (31120322323321), we get a palindrome (43452644625434).
The spelling of 12332322302113 in words is "twelve trillion, three hundred thirty-two billion, three hundred twenty-two million, three hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •