Base | Representation |
---|---|
bin | 10100101111000011… |
… | …00110001110011101 |
3 | 1001201211000100110210 |
4 | 22113201212032131 |
5 | 140244304222113 |
6 | 5040343323033 |
7 | 542602205340 |
oct | 122741461635 |
9 | 31654010423 |
10 | 11132101533 |
11 | 47a2865713 |
12 | 21a8150479 |
13 | 10853ca837 |
14 | 77865a457 |
15 | 4524856c3 |
hex | 29786639d |
11132101533 has 48 divisors (see below), whose sum is σ = 17732252160. Its totient is φ = 6083446464.
The previous prime is 11132101531. The next prime is 11132101537. The reversal of 11132101533 is 33510123111.
It is not a de Polignac number, because 11132101533 - 21 = 11132101531 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11132101531) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1692910 + ... + 1699472.
It is an arithmetic number, because the mean of its divisors is an integer number (369421920).
Almost surely, 211132101533 is an apocalyptic number.
It is an amenable number.
11132101533 is a deficient number, since it is larger than the sum of its proper divisors (6600150627).
11132101533 is an equidigital number, since it uses as much as digits as its factorization.
11132101533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6706 (or 6669 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 11132101533 its reverse (33510123111), we get a palindrome (44642224644).
The spelling of 11132101533 in words is "eleven billion, one hundred thirty-two million, one hundred one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •