Base | Representation |
---|---|
bin | 10100101110111100… |
… | …10001110001110110 |
3 | 1001201202101010210210 |
4 | 22113132101301312 |
5 | 140244043400400 |
6 | 5040312530250 |
7 | 542561622351 |
oct | 122736216166 |
9 | 31652333723 |
10 | 11131231350 |
11 | 47a2320958 |
12 | 21a79b0986 |
13 | 1085184735 |
14 | 7784b1298 |
15 | 452362950 |
hex | 297791c76 |
11131231350 has 48 divisors (see below), whose sum is σ = 27759741120. Its totient is φ = 2951738400.
The previous prime is 11131231303. The next prime is 11131231351. The reversal of 11131231350 is 5313213111.
It is a super-2 number, since 2×111312313502 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131231351) 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 23 ways as a sum of consecutive naturals, for example, 180436 + ... + 234135.
It is an arithmetic number, because the mean of its divisors is an integer number (578327940).
Almost surely, 211131231350 is an apocalyptic number.
11131231350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11131231350 is an abundant number, since it is smaller than the sum of its proper divisors (16628509770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131231350 is a wasteful number, since it uses less digits than its factorization.
11131231350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414765 (or 414760 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 11131231350 its reverse (5313213111), we get a palindrome (16444444461).
The spelling of 11131231350 in words is "eleven billion, one hundred thirty-one million, two hundred thirty-one thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •