Base | Representation |
---|---|
bin | 10100101110111110… |
… | …10011110111010111 |
3 | 1001201202212220010022 |
4 | 22113133103313113 |
5 | 140244131031124 |
6 | 5040322415355 |
7 | 542564130500 |
oct | 122737236727 |
9 | 31652786108 |
10 | 11131502039 |
11 | 47a2496269 |
12 | 21a7b0155b |
13 | 108524a9c8 |
14 | 778541ba7 |
15 | 4523b7c5e |
hex | 2977d3dd7 |
11131502039 has 6 divisors (see below), whose sum is σ = 12948890184. Its totient is φ = 9541287420.
The previous prime is 11131501987. The next prime is 11131502077. The reversal of 11131502039 is 93020513111.
It is not a de Polignac number, because 11131502039 - 212 = 11131497943 is a prime.
It is a super-2 number, since 2×111315020392 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11131501999 and 11131502017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131502839) 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 5 ways as a sum of consecutive naturals, for example, 113586707 + ... + 113586804.
It is an arithmetic number, because the mean of its divisors is an integer number (2158148364).
Almost surely, 211131502039 is an apocalyptic number.
11131502039 is a deficient number, since it is larger than the sum of its proper divisors (1817388145).
11131502039 is an equidigital number, since it uses as much as digits as its factorization.
11131502039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227173525 (or 227173518 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 26.
The spelling of 11131502039 in words is "eleven billion, one hundred thirty-one million, five hundred two thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •