Base | Representation |
---|---|
bin | 11110010001000000011100… |
… | …111101100010100011101100 |
3 | 122110022012110121001121010220 |
4 | 132101000130331202203230 |
5 | 114421334002224111022 |
6 | 1151033535202531340 |
7 | 40015613446302564 |
oct | 3621003475424354 |
9 | 573265417047126 |
10 | 133110112332012 |
11 | 3945a755268792 |
12 | 12b1976b366b50 |
13 | 59372ca95291a |
14 | 24c27c7159da4 |
15 | 105c775bc385c |
hex | 79101cf628ec |
133110112332012 has 12 divisors (see below), whose sum is σ = 310590262108056. Its totient is φ = 44370037444000.
The previous prime is 133110112332007. The next prime is 133110112332133. The reversal of 133110112332012 is 210233211011331.
It is a tau number, because it is divible by the number of its divisors (12).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5546254680489 + ... + 5546254680512.
It is an arithmetic number, because the mean of its divisors is an integer number (25882521842338).
Almost surely, 2133110112332012 is an apocalyptic number.
133110112332012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133110112332012 is an abundant number, since it is smaller than the sum of its proper divisors (177480149776044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133110112332012 is a wasteful number, since it uses less digits than its factorization.
133110112332012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11092509361008 (or 11092509361006 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 133110112332012 its reverse (210233211011331), we get a palindrome (343343323343343).
The spelling of 133110112332012 in words is "one hundred thirty-three trillion, one hundred ten billion, one hundred twelve million, three hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •