Base | Representation |
---|---|
bin | 111110000010010011… |
… | …0111101111011111001 |
3 | 110201212102101202111001 |
4 | 1330010212331323321 |
5 | 4140314123411301 |
6 | 141111231005001 |
7 | 12424230311200 |
oct | 1740446757371 |
9 | 421772352431 |
10 | 133221310201 |
11 | 51553a58171 |
12 | 2199b669761 |
13 | c741394c45 |
14 | 663b240237 |
15 | 36eaa70c01 |
hex | 1f049bdef9 |
133221310201 has 6 divisors (see below), whose sum is σ = 154971728250. Its totient is φ = 114189694416.
The previous prime is 133221310153. The next prime is 133221310219. The reversal of 133221310201 is 102013122331.
It can be written as a sum of positive squares in only one way, i.e., 80102584576 + 53118725625 = 283024^2 + 230475^2 .
It is a de Polignac number, because none of the positive numbers 2k-133221310201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133221340201) 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 5 ways as a sum of consecutive naturals, for example, 1359401076 + ... + 1359401173.
It is an arithmetic number, because the mean of its divisors is an integer number (25828621375).
Almost surely, 2133221310201 is an apocalyptic number.
It is an amenable number.
133221310201 is a deficient number, since it is larger than the sum of its proper divisors (21750418049).
133221310201 is an equidigital number, since it uses as much as digits as its factorization.
133221310201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2718802263 (or 2718802256 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 133221310201 its reverse (102013122331), we get a palindrome (235234432532).
The spelling of 133221310201 in words is "one hundred thirty-three billion, two hundred twenty-one million, three hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •