Base | Representation |
---|---|
bin | 11110010010010110011100… |
… | …001100101100011001011001 |
3 | 122110122000210011100100211020 |
4 | 132102112130030230121121 |
5 | 114424342044434332441 |
6 | 1151144205021353053 |
7 | 40025362445630601 |
oct | 3622263414543131 |
9 | 573560704310736 |
10 | 133202441324121 |
11 | 39495924602044 |
12 | 12b33638108789 |
13 | 5942c2312b330 |
14 | 24c70654b1c01 |
15 | 105ed7b74be66 |
hex | 79259c32c659 |
133202441324121 has 64 divisors (see below), whose sum is σ = 199791279959040. Its totient is φ = 78392724238080.
The previous prime is 133202441324107. The next prime is 133202441324131. The reversal of 133202441324121 is 121423144202331.
It is not a de Polignac number, because 133202441324121 - 210 = 133202441323097 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (133202441324131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 640381666 + ... + 640589636.
It is an arithmetic number, because the mean of its divisors is an integer number (3121738749360).
Almost surely, 2133202441324121 is an apocalyptic number.
It is an amenable number.
133202441324121 is a deficient number, since it is larger than the sum of its proper divisors (66588838634919).
133202441324121 is a wasteful number, since it uses less digits than its factorization.
133202441324121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215606.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 133202441324121 its reverse (121423144202331), we get a palindrome (254625585526452).
The spelling of 133202441324121 in words is "one hundred thirty-three trillion, two hundred two billion, four hundred forty-one million, three hundred twenty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •