Search a number
-
+
2011516151133 = 35983136921663
BaseRepresentation
bin11101010001010111101…
…101001010010101011101
321010022002000111221110010
4131101113231022111131
5230424041113314013
64140024444033433
7265220150113506
oct35212755122535
97108060457403
102011516151133
11706096477665
12285a18832879
131178ba3aa398
146d50211bbad
15374ce0257c3
hex1d457b4a55d

2011516151133 has 16 divisors (see below), whose sum is σ = 2760340746240. Its totient is φ = 1302398848944.

The previous prime is 2011516151123. The next prime is 2011516151159. The reversal of 2011516151133 is 3311516151102.

It is not a de Polignac number, because 2011516151133 - 28 = 2011516150877 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 2011516151133.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2011516151123) 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 15 ways as a sum of consecutive naturals, for example, 68446141 + ... + 68475522.

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

Almost surely, 22011516151133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 136921808.

The product of its (nonzero) digits is 2700, while the sum is 30.

The spelling of 2011516151133 in words is "two trillion, eleven billion, five hundred sixteen million, one hundred fifty-one thousand, one hundred thirty-three".

Divisors: 1 3 59 83 177 249 4897 14691 136921663 410764989 8078378117 11364498029 24235134351 34093494087 670505383711 2011516151133