Base | Representation |
---|---|
bin | 1011000001000101100100… |
… | …0101001011000100111001 |
3 | 1120220000112212100110022021 |
4 | 2300101121011023010321 |
5 | 3041431020342144113 |
6 | 41432435123354441 |
7 | 2360104631466421 |
oct | 260213105130471 |
9 | 46800485313267 |
10 | 12113302303033 |
11 | 395024a3a2078 |
12 | 1437780522a21 |
13 | 69b3830c7149 |
14 | 2dc4035bb481 |
15 | 160164dc348d |
hex | b045914b139 |
12113302303033 has 8 divisors (see below), whose sum is σ = 12128252558400. Its totient is φ = 12098352864528.
The previous prime is 12113302303031. The next prime is 12113302303043. The reversal of 12113302303033 is 33030320331121.
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 12113302303033 - 21 = 12113302303031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12113302302989 and 12113302303007.
It is not an unprimeable number, because it can be changed into a prime (12113302303031) 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, 32743110 + ... + 33110992.
It is an arithmetic number, because the mean of its divisors is an integer number (1516031569800).
Almost surely, 212113302303033 is an apocalyptic number.
It is an amenable number.
12113302303033 is a deficient number, since it is larger than the sum of its proper divisors (14950255367).
12113302303033 is an equidigital number, since it uses as much as digits as its factorization.
12113302303033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 408431.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 12113302303033 its reverse (33030320331121), we get a palindrome (45143622634154).
The spelling of 12113302303033 in words is "twelve trillion, one hundred thirteen billion, three hundred two million, three hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •