Base | Representation |
---|---|
bin | 11101010001010111101… |
… | …101001010010101011101 |
3 | 21010022002000111221110010 |
4 | 131101113231022111131 |
5 | 230424041113314013 |
6 | 4140024444033433 |
7 | 265220150113506 |
oct | 35212755122535 |
9 | 7108060457403 |
10 | 2011516151133 |
11 | 706096477665 |
12 | 285a18832879 |
13 | 1178ba3aa398 |
14 | 6d50211bbad |
15 | 374ce0257c3 |
hex | 1d457b4a55d |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •