Base | Representation |
---|---|
bin | 111110000001101100… |
… | …1100100100100100101 |
3 | 110201211000012222020100 |
4 | 1330003121210210211 |
5 | 4140243430134341 |
6 | 141105224054313 |
7 | 12423562666512 |
oct | 1740331444445 |
9 | 421730188210 |
10 | 133201021221 |
11 | 5154355a814 |
12 | 21994904399 |
13 | c73a110128 |
14 | 663867c309 |
15 | 36e8db43b6 |
hex | 1f03664925 |
133201021221 has 6 divisors (see below), whose sum is σ = 192401475110. Its totient is φ = 88800680808.
The previous prime is 133201021211. The next prime is 133201021241. The reversal of 133201021221 is 122120102331.
It can be written as a sum of positive squares in only one way, i.e., 132724690596 + 476330625 = 364314^2 + 21825^2 .
It is not a de Polignac number, because 133201021221 - 25 = 133201021189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133201021194 and 133201021203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133201021211) 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 5 ways as a sum of consecutive naturals, for example, 7400056726 + ... + 7400056743.
Almost surely, 2133201021221 is an apocalyptic number.
It is an amenable number.
133201021221 is a deficient number, since it is larger than the sum of its proper divisors (59200453889).
133201021221 is a wasteful number, since it uses less digits than its factorization.
133201021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14800113475 (or 14800113472 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 133201021221 its reverse (122120102331), we get a palindrome (255321123552).
The spelling of 133201021221 in words is "one hundred thirty-three billion, two hundred one million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •