Base | Representation |
---|---|
bin | 101101101110110111101110… |
… | …111111110110101111101101 |
3 | 222101011010111220112022210112 |
4 | 231232313232333312233231 |
5 | 202330330423001033401 |
6 | 1551435123451345405 |
7 | 60236245030636232 |
oct | 5556675677665755 |
9 | 871133456468715 |
10 | 201133033221101 |
11 | 590a60497a9273 |
12 | 1a684b19a52265 |
13 | 882c9c0975917 |
14 | 3794c68309789 |
15 | 183bde9ac13bb |
hex | b6edeeff6bed |
201133033221101 has 8 divisors (see below), whose sum is σ = 207790130688000. Its totient is φ = 194486494198320.
The previous prime is 201133033221089. The next prime is 201133033221187. The reversal of 201133033221101 is 101122330331102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201133033221101 - 230 = 201131959479277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201133033281101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2639572301 + ... + 2639648498.
It is an arithmetic number, because the mean of its divisors is an integer number (25973766336000).
Almost surely, 2201133033221101 is an apocalyptic number.
It is an amenable number.
201133033221101 is a deficient number, since it is larger than the sum of its proper divisors (6657097466899).
201133033221101 is a wasteful number, since it uses less digits than its factorization.
201133033221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5279222059.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 201133033221101 its reverse (101122330331102), we get a palindrome (302255363552203).
The spelling of 201133033221101 in words is "two hundred one trillion, one hundred thirty-three billion, thirty-three million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •