Base | Representation |
---|---|
bin | 10100101110010110… |
… | …00101110010111101 |
3 | 1001201101220121012021 |
4 | 22113023011302331 |
5 | 140241301422113 |
6 | 5040013040141 |
7 | 542501103226 |
oct | 122713056275 |
9 | 31641817167 |
10 | 11126201533 |
11 | 479a4a5987 |
12 | 21a6186051 |
13 | 1084113205 |
14 | 77796224d |
15 | 451bbc48d |
hex | 2972c5cbd |
11126201533 has 8 divisors (see below), whose sum is σ = 11334700800. Its totient is φ = 10918366368.
The previous prime is 11126201521. The next prime is 11126201549. The reversal of 11126201533 is 33510262111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11126201533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11126201498 and 11126201507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11126201563) 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 7 ways as a sum of consecutive naturals, for example, 132141 + ... + 199282.
It is an arithmetic number, because the mean of its divisors is an integer number (1416837600).
Almost surely, 211126201533 is an apocalyptic number.
It is an amenable number.
11126201533 is a deficient number, since it is larger than the sum of its proper divisors (208499267).
11126201533 is an equidigital number, since it uses as much as digits as its factorization.
11126201533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332051.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 11126201533 its reverse (33510262111), we get a palindrome (44636463644).
The spelling of 11126201533 in words is "eleven billion, one hundred twenty-six million, two hundred one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •