Base | Representation |
---|---|
bin | 1010000001001101110111… |
… | …0000100101111101000011 |
3 | 1110000010021010210210200120 |
4 | 2200103131300211331003 |
5 | 2420441300230300201 |
6 | 35232404351551323 |
7 | 2214611106361140 |
oct | 240233560457503 |
9 | 43003233723616 |
10 | 11016016650051 |
11 | 3567959237186 |
12 | 129ab8982b543 |
13 | 61ba6278998a |
14 | 2a126c7dd3c7 |
15 | 14184288d536 |
hex | a04ddc25f43 |
11016016650051 has 8 divisors (see below), whose sum is σ = 16786311085824. Its totient is φ = 6294866657160.
The previous prime is 11016016650031. The next prime is 11016016650053. The reversal of 11016016650051 is 15005661061011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11016016650051 - 211 = 11016016648003 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11016016649994 and 11016016650021.
It is not an unprimeable number, because it can be changed into a prime (11016016650053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262286110695 + ... + 262286110736.
It is an arithmetic number, because the mean of its divisors is an integer number (2098288885728).
Almost surely, 211016016650051 is an apocalyptic number.
11016016650051 is a deficient number, since it is larger than the sum of its proper divisors (5770294435773).
11016016650051 is an equidigital number, since it uses as much as digits as its factorization.
11016016650051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524572221441.
The product of its (nonzero) digits is 5400, while the sum is 33.
The spelling of 11016016650051 in words is "eleven trillion, sixteen billion, sixteen million, six hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •