Base | Representation |
---|---|
bin | 10100101110111101… |
… | …00011010010001011 |
3 | 1001201202111210011101 |
4 | 22113132203102023 |
5 | 140244103144201 |
6 | 5040314242231 |
7 | 542562341401 |
oct | 122736432213 |
9 | 31652453141 |
10 | 11131303051 |
11 | 47a236a810 |
12 | 21a7a26377 |
13 | 10851ab26b |
14 | 7784cd471 |
15 | 452378d01 |
hex | 2977a348b |
11131303051 has 4 divisors (see below), whose sum is σ = 12143239704. Its totient is φ = 10119366400.
The previous prime is 11131303039. The next prime is 11131303067. The reversal of 11131303051 is 15030313111.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11131303051 - 229 = 10594432139 is a prime.
It is a super-2 number, since 2×111313030512 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11131303451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505968310 + ... + 505968331.
It is an arithmetic number, because the mean of its divisors is an integer number (3035809926).
Almost surely, 211131303051 is an apocalyptic number.
11131303051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11131303051 is a deficient number, since it is larger than the sum of its proper divisors (1011936653).
11131303051 is a wasteful number, since it uses less digits than its factorization.
11131303051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1011936652.
The product of its (nonzero) digits is 135, while the sum is 19.
Adding to 11131303051 its reverse (15030313111), we get a palindrome (26161616162).
It can be divided in two parts, 1113 and 1303051, that added together give a square (1304164 = 11422).
The spelling of 11131303051 in words is "eleven billion, one hundred thirty-one million, three hundred three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •