Base | Representation |
---|---|
bin | 1010100110011110001011… |
… | …0000011110101101011001 |
3 | 1112021022022012122221021210 |
4 | 2221213202300132231121 |
5 | 3011433042430233221 |
6 | 40442414333253333 |
7 | 2312056541436225 |
oct | 251474260365531 |
9 | 45238265587253 |
10 | 11656050633561 |
11 | 379433778a064 |
12 | 138302b934249 |
13 | 667212537909 |
14 | 2c4227979785 |
15 | 1533021a7276 |
hex | a99e2c1eb59 |
11656050633561 has 8 divisors (see below), whose sum is σ = 15542233747264. Its totient is φ = 7770283971120.
The previous prime is 11656050633533. The next prime is 11656050633599. The reversal of 11656050633561 is 16533605065611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11656050633561 - 25 = 11656050633529 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11656050633561.
It is not an unprimeable number, because it can be changed into a prime (11656050632561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104047501 + ... + 104159466.
It is an arithmetic number, because the mean of its divisors is an integer number (1942779218408).
Almost surely, 211656050633561 is an apocalyptic number.
It is an amenable number.
11656050633561 is a deficient number, since it is larger than the sum of its proper divisors (3886183113703).
11656050633561 is a wasteful number, since it uses less digits than its factorization.
11656050633561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208225631.
The product of its (nonzero) digits is 1458000, while the sum is 48.
The spelling of 11656050633561 in words is "eleven trillion, six hundred fifty-six billion, fifty million, six hundred thirty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •