Search a number
-
+
101113013133 = 32111021343567
BaseRepresentation
bin101111000101011001…
…1100010001110001101
3100122222201222021020100
41132022303202032031
53124034412410013
6114241202441313
710206450300516
oct1361263421615
9318881867210
10101113013133
1139977729370
121771a663239
1396c52985b2
144c72bc9a0d
15296bce1473
hex178ace238d

101113013133 has 12 divisors (see below), whose sum is σ = 159329596608. Its totient is φ = 61280613960.

The previous prime is 101113013107. The next prime is 101113013179. The reversal of 101113013133 is 331310311101.

It is not a de Polignac number, because 101113013133 - 28 = 101113012877 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101113013033) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 510671685 + ... + 510671882.

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

Almost surely, 2101113013133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1021343584 (or 1021343581 counting only the distinct ones).

The product of its (nonzero) digits is 81, while the sum is 18.

Adding to 101113013133 its reverse (331310311101), we get a palindrome (432423324234).

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

Divisors: 1 3 9 11 33 99 1021343567 3064030701 9192092103 11234779237 33704337711 101113013133