Base | Representation |
---|---|
bin | 10100101110111100… |
… | …10110011010110001 |
3 | 1001201202102002212121 |
4 | 22113132112122301 |
5 | 140244100002403 |
6 | 5040313154241 |
7 | 542562031636 |
oct | 122736263261 |
9 | 31652362777 |
10 | 11131250353 |
11 | 47a2334163 |
12 | 21a79bb981 |
13 | 1085190292 |
14 | 7784b818d |
15 | 4523683bd |
hex | 2977966b1 |
11131250353 has 4 divisors (see below), whose sum is σ = 11134397428. Its totient is φ = 11128103280.
The previous prime is 11131250309. The next prime is 11131250357. The reversal of 11131250353 is 35305213111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9156958864 + 1974291489 = 95692^2 + 44433^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11131250353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11131250357) 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 3 ways as a sum of consecutive naturals, for example, 1568226 + ... + 1575307.
It is an arithmetic number, because the mean of its divisors is an integer number (2783599357).
Almost surely, 211131250353 is an apocalyptic number.
It is an amenable number.
11131250353 is a deficient number, since it is larger than the sum of its proper divisors (3147075).
11131250353 is an equidigital number, since it uses as much as digits as its factorization.
11131250353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3147074.
The product of its (nonzero) digits is 1350, while the sum is 25.
Adding to 11131250353 its reverse (35305213111), we get a palindrome (46436463464).
The spelling of 11131250353 in words is "eleven billion, one hundred thirty-one million, two hundred fifty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •