Search a number
-
+
101202201133 = 1128332509541
BaseRepresentation
bin101111001000000011…
…1110000101000101101
3100200012221210111011121
41132100013300220231
53124230230414013
6114254110220541
710211612342035
oct1362007605055
9320187714147
10101202201133
1139a13005660
12177444b4751
13970a8c4a67
144c809a48c5
152974a5c58d
hex17901f0a2d

101202201133 has 8 divisors (see below), whose sum is σ = 110792519136. Its totient is φ = 91676902800.

The previous prime is 101202201131. The next prime is 101202201167. The reversal of 101202201133 is 331102202101.

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 101202201133 - 21 = 101202201131 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 (101202201131) 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 7 ways as a sum of consecutive naturals, for example, 16251658 + ... + 16257883.

It is an arithmetic number, because the mean of its divisors is an integer number (13849064892).

Almost surely, 2101202201133 is an apocalyptic number.

It is an amenable number.

101202201133 is a deficient number, since it is larger than the sum of its proper divisors (9590318003).

101202201133 is a wasteful number, since it uses less digits than its factorization.

101202201133 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 32509835.

The product of its (nonzero) digits is 72, while the sum is 16.

Adding to 101202201133 its reverse (331102202101), we get a palindrome (432304403234).

The spelling of 101202201133 in words is "one hundred one billion, two hundred two million, two hundred one thousand, one hundred thirty-three".

Divisors: 1 11 283 3113 32509541 357604951 9200200103 101202201133