Base | Representation |
---|---|
bin | 1010000100001000001111… |
… | …1110111010010011111001 |
3 | 1110011220102001111110021202 |
4 | 2201002003332322103321 |
5 | 2422301232303432221 |
6 | 35311401225343545 |
7 | 2221332015351425 |
oct | 241020376722371 |
9 | 43156361443252 |
10 | 11066050061561 |
11 | 35870a384a850 |
12 | 12a8811937bb5 |
13 | 6236a7427411 |
14 | 2a3857749b85 |
15 | 142cc0132d0b |
hex | a1083fba4f9 |
11066050061561 has 8 divisors (see below), whose sum is σ = 12076877676864. Its totient is φ = 10056026290320.
The previous prime is 11066050061527. The next prime is 11066050061581. The reversal of 11066050061561 is 16516005066011.
11066050061561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11066050061561 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11066050061581) 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, 200932226 + ... + 200987291.
It is an arithmetic number, because the mean of its divisors is an integer number (1509609709608).
Almost surely, 211066050061561 is an apocalyptic number.
11066050061561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11066050061561 is a deficient number, since it is larger than the sum of its proper divisors (1010827615303).
11066050061561 is a wasteful number, since it uses less digits than its factorization.
11066050061561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401922031.
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 11066050061561 in words is "eleven trillion, sixty-six billion, fifty million, sixty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •