Base | Representation |
---|---|
bin | 1111000100010010001010… |
… | …11001110011000100000101 |
3 | 11100022102212211022221122112 |
4 | 13202021011121303010011 |
5 | 13320320421240041010 |
6 | 154244514004110405 |
7 | 6656514165122030 |
oct | 742110531630405 |
9 | 140272784287575 |
10 | 33132542112005 |
11 | a614483293276 |
12 | 3871385395405 |
13 | 15645016c905b |
14 | 8278a3202017 |
15 | 3c6cc0629a05 |
hex | 1e2245673105 |
33132542112005 has 16 divisors (see below), whose sum is σ = 47830436734080. Its totient is φ = 21523696529472.
The previous prime is 33132542111993. The next prime is 33132542112041. The reversal of 33132542112005 is 50021124523133.
It is a cyclic number.
It is not a de Polignac number, because 33132542112005 - 218 = 33132541849861 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24911685134 + ... + 24911686463.
It is an arithmetic number, because the mean of its divisors is an integer number (2989402295880).
Almost surely, 233132542112005 is an apocalyptic number.
33132542112005 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
33132542112005 is a deficient number, since it is larger than the sum of its proper divisors (14697894622075).
33132542112005 is a wasteful number, since it uses less digits than its factorization.
33132542112005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49823371628.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 33132542112005 its reverse (50021124523133), we get a palindrome (83153666635138).
The spelling of 33132542112005 in words is "thirty-three trillion, one hundred thirty-two billion, five hundred forty-two million, one hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •