Base | Representation |
---|---|
bin | 1010000011011000110110… |
… | …1011111010111101001001 |
3 | 1110010200120102121102020002 |
4 | 2200312031223322331021 |
5 | 2422044203424004422 |
6 | 35301455002412345 |
7 | 2220401525255156 |
oct | 240661553727511 |
9 | 43120512542202 |
10 | 11053327953737 |
11 | 3581765519953 |
12 | 12a62612010b5 |
13 | 62242a7b2874 |
14 | 2a2dabc7b22d |
15 | 1427c82c4692 |
hex | a0d8dafaf49 |
11053327953737 has 4 divisors (see below), whose sum is σ = 11310382092240. Its totient is φ = 10796273815236.
The previous prime is 11053327953671. The next prime is 11053327953739. The reversal of 11053327953737 is 73735972335011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11053327953737 - 210 = 11053327952713 is a prime.
It is a super-2 number, since 2×110533279537372 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11053327953739) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128527069187 + ... + 128527069272.
It is an arithmetic number, because the mean of its divisors is an integer number (2827595523060).
Almost surely, 211053327953737 is an apocalyptic number.
It is an amenable number.
11053327953737 is a deficient number, since it is larger than the sum of its proper divisors (257054138503).
11053327953737 is an equidigital number, since it uses as much as digits as its factorization.
11053327953737 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257054138502.
The product of its (nonzero) digits is 12502350, while the sum is 56.
The spelling of 11053327953737 in words is "eleven trillion, fifty-three billion, three hundred twenty-seven million, nine hundred fifty-three thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •