Base | Representation |
---|---|
bin | 10101011110101001… |
… | …00010011000011101 |
3 | 1002202122020022111002 |
4 | 22233110202120131 |
5 | 142104010043401 |
6 | 5144124240045 |
7 | 555520461053 |
oct | 125724423035 |
9 | 32678208432 |
10 | 11531331101 |
11 | 4988154804 |
12 | 22999a0025 |
13 | 111a02c554 |
14 | 7b56a01d3 |
15 | 477545a6b |
hex | 2af52261d |
11531331101 has 8 divisors (see below), whose sum is σ = 11552291520. Its totient is φ = 11510387712.
The previous prime is 11531331079. The next prime is 11531331109. The reversal of 11531331101 is 10113313511.
11531331101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11531331101 - 218 = 11531068957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11531331109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2922536 + ... + 2926478.
It is an arithmetic number, because the mean of its divisors is an integer number (1444036440).
Almost surely, 211531331101 is an apocalyptic number.
It is an amenable number.
11531331101 is a deficient number, since it is larger than the sum of its proper divisors (20960419).
11531331101 is an equidigital number, since it uses as much as digits as its factorization.
11531331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8515.
The product of its (nonzero) digits is 135, while the sum is 20.
Adding to 11531331101 its reverse (10113313511), we get a palindrome (21644644612).
The spelling of 11531331101 in words is "eleven billion, five hundred thirty-one million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •