Base | Representation |
---|---|
bin | 1010001001000010001001… |
… | …0011000101110100011001 |
3 | 1110110221220022102202201021 |
4 | 2202100202103011310121 |
5 | 2430141313443432304 |
6 | 35414214255522441 |
7 | 2230404042462655 |
oct | 242204223056431 |
9 | 43427808382637 |
10 | 11150310530329 |
11 | 36099026740a3 |
12 | 1301008529421 |
13 | 62b61511a369 |
14 | 2a796c27ba65 |
15 | 1450a2677a54 |
hex | a24224c5d19 |
11150310530329 has 8 divisors (see below), whose sum is σ = 11194051557888. Its totient is φ = 11106572252160.
The previous prime is 11150310530323. The next prime is 11150310530393. The reversal of 11150310530329 is 92303501305111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11150310530329 - 27 = 11150310530201 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11150310530294 and 11150310530303.
It is not an unprimeable number, because it can be changed into a prime (11150310530323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7636984 + ... + 8979094.
It is an arithmetic number, because the mean of its divisors is an integer number (1399256444736).
Almost surely, 211150310530329 is an apocalyptic number.
It is an amenable number.
11150310530329 is a deficient number, since it is larger than the sum of its proper divisors (43741027559).
11150310530329 is a wasteful number, since it uses less digits than its factorization.
11150310530329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1374695.
The product of its (nonzero) digits is 12150, while the sum is 34.
The spelling of 11150310530329 in words is "eleven trillion, one hundred fifty billion, three hundred ten million, five hundred thirty thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •