Base | Representation |
---|---|
bin | 1011000010010000000100… |
… | …0110100010001011110110 |
3 | 1120221221011121121200002110 |
4 | 2300210001012202023312 |
5 | 3042243000040220202 |
6 | 41445543411151450 |
7 | 2361413340456633 |
oct | 260440106421366 |
9 | 46857147550073 |
10 | 12133301101302 |
11 | 3958782180227 |
12 | 143b621ba5586 |
13 | 6a021c470aa4 |
14 | 2dd37d66d18a |
15 | 1609359a326c |
hex | b09011a22f6 |
12133301101302 has 16 divisors (see below), whose sum is σ = 24267523557312. Its totient is φ = 4044280141320.
The previous prime is 12133301101093. The next prime is 12133301101303. The reversal of 12133301101302 is 20310110333121.
It is a happy number.
It is a super-2 number, since 2×121333011013022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12133301101303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38218524 + ... + 38534687.
It is an arithmetic number, because the mean of its divisors is an integer number (1516720222332).
Almost surely, 212133301101302 is an apocalyptic number.
12133301101302 is an abundant number, since it is smaller than the sum of its proper divisors (12134222456010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12133301101302 is a wasteful number, since it uses less digits than its factorization.
12133301101302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76779563.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 12133301101302 its reverse (20310110333121), we get a palindrome (32443411434423).
The spelling of 12133301101302 in words is "twelve trillion, one hundred thirty-three billion, three hundred one million, one hundred one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •