Base | Representation |
---|---|
bin | 1010000011100000000100… |
… | …0011100000010111100101 |
3 | 1110010212120022201011200020 |
4 | 2200320001003200113211 |
5 | 2422112134430004013 |
6 | 35302415024305353 |
7 | 2220500510261214 |
oct | 240700103402745 |
9 | 43125508634606 |
10 | 11055263516133 |
11 | 35825690545a1 |
12 | 12a6701472259 |
13 | 6226787b8165 |
14 | 2a3112d6107b |
15 | 14288d1a9623 |
hex | a0e010e05e5 |
11055263516133 has 4 divisors (see below), whose sum is σ = 14740351354848. Its totient is φ = 7370175677420.
The previous prime is 11055263516069. The next prime is 11055263516161. The reversal of 11055263516133 is 33161536255011.
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 11055263516133 - 26 = 11055263516069 is a prime.
It is a super-2 number, since 2×110552635161332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11055263516173) 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, 1842543919353 + ... + 1842543919358.
It is an arithmetic number, because the mean of its divisors is an integer number (3685087838712).
Almost surely, 211055263516133 is an apocalyptic number.
It is an amenable number.
11055263516133 is a deficient number, since it is larger than the sum of its proper divisors (3685087838715).
11055263516133 is an equidigital number, since it uses as much as digits as its factorization.
11055263516133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3685087838714.
The product of its (nonzero) digits is 243000, while the sum is 42.
The spelling of 11055263516133 in words is "eleven trillion, fifty-five billion, two hundred sixty-three million, five hundred sixteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •