Base | Representation |
---|---|
bin | 1010001001000011000000… |
… | …0110001001111011101011 |
3 | 1110110222111110000200022001 |
4 | 2202100300012021323223 |
5 | 2430142302224122311 |
6 | 35414253245311431 |
7 | 2230412553222640 |
oct | 242206006117353 |
9 | 43428443020261 |
10 | 11150542020331 |
11 | 3609a11304a4a |
12 | 1301071b65577 |
13 | 62b65107b8ac |
14 | 2a7990cd9dc7 |
15 | 1450b7b524c1 |
hex | a2430189eeb |
11150542020331 has 24 divisors (see below), whose sum is σ = 14022769080320. Its totient is φ = 8660898225936.
The previous prime is 11150542020221. The next prime is 11150542020337. The reversal of 11150542020331 is 13302024505111.
It is not a de Polignac number, because 11150542020331 - 219 = 11150541496043 is a prime.
It is a super-2 number, since 2×111505420203312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11150542020331.
It is not an unprimeable number, because it can be changed into a prime (11150542020337) 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, 79172235 + ... + 79312948.
Almost surely, 211150542020331 is an apocalyptic number.
11150542020331 is a deficient number, since it is larger than the sum of its proper divisors (2872227059989).
11150542020331 is a wasteful number, since it uses less digits than its factorization.
11150542020331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158485255 (or 158485232 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 11150542020331 its reverse (13302024505111), we get a palindrome (24452566525442).
The spelling of 11150542020331 in words is "eleven trillion, one hundred fifty billion, five hundred forty-two million, twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •