Base | Representation |
---|---|
bin | 10100101110110011… |
… | …00101011011110101 |
3 | 1001201200001122021111 |
4 | 22113121211123311 |
5 | 140243240014031 |
6 | 5040230315021 |
7 | 542545306630 |
oct | 122731453365 |
9 | 31650048244 |
10 | 11130001141 |
11 | 47a1660656 |
12 | 21a74b8a71 |
13 | 1084b437bc |
14 | 778270c17 |
15 | 4521bd1b1 |
hex | 2976656f5 |
11130001141 has 8 divisors (see below), whose sum is σ = 12720735360. Its totient is φ = 9539450448.
The previous prime is 11130001123. The next prime is 11130001159. The reversal of 11130001141 is 14110003111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11130001123) and next prime (11130001159).
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 11130001141 - 213 = 11129992949 is a prime.
It is a super-2 number, since 2×111300011412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11130101141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128040 + ... + 196606.
It is an arithmetic number, because the mean of its divisors is an integer number (1590091920).
Almost surely, 211130001141 is an apocalyptic number.
It is an amenable number.
11130001141 is a deficient number, since it is larger than the sum of its proper divisors (1590734219).
11130001141 is an equidigital number, since it uses as much as digits as its factorization.
11130001141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91763.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11130001141 its reverse (14110003111), we get a palindrome (25240004252).
The spelling of 11130001141 in words is "eleven billion, one hundred thirty million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •