Base | Representation |
---|---|
bin | 1011001101101100111101… |
… | …0000010100101001110100 |
3 | 1121122201222012221221211222 |
4 | 2303123033100110221310 |
5 | 3104003402011132012 |
6 | 42120201125045512 |
7 | 2411546501544440 |
oct | 263331720245164 |
9 | 47581865857758 |
10 | 12330033302132 |
11 | 3a241573a0557 |
12 | 1471787256898 |
13 | 6b5942773590 |
14 | 308ac3757820 |
15 | 165aec0d5972 |
hex | b36cf414a74 |
12330033302132 has 48 divisors (see below), whose sum is σ = 28119170983680. Its totient is φ = 4590885053952.
The previous prime is 12330033302123. The next prime is 12330033302179. The reversal of 12330033302132 is 23120333003321.
It is a happy number.
12330033302132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 996279632 + ... + 996292007.
It is an arithmetic number, because the mean of its divisors is an integer number (585816062160).
Almost surely, 212330033302132 is an apocalyptic number.
It is an amenable number.
12330033302132 is an abundant number, since it is smaller than the sum of its proper divisors (15789137681548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12330033302132 is a wasteful number, since it uses less digits than its factorization.
12330033302132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1992571680 (or 1992571678 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 12330033302132 its reverse (23120333003321), we get a palindrome (35450366305453).
The spelling of 12330033302132 in words is "twelve trillion, three hundred thirty billion, thirty-three million, three hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •