Base | Representation |
---|---|
bin | 1010000011100100001000… |
… | …0001100010100110111111 |
3 | 1110010222101021202002222011 |
4 | 2200321002001202212333 |
5 | 2422121403000120223 |
6 | 35303115123032051 |
7 | 2220536514202225 |
oct | 240710201424677 |
9 | 43128337662864 |
10 | 11056353520063 |
11 | 3582a78361695 |
12 | 12a696650b627 |
13 | 6227c0578cb7 |
14 | 2a31b7a1ab15 |
15 | 142903c1880d |
hex | a0e420629bf |
11056353520063 has 2 divisors, whose sum is σ = 11056353520064. Its totient is φ = 11056353520062.
The previous prime is 11056353520061. The next prime is 11056353520073. The reversal of 11056353520063 is 36002535365011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11056353520063 - 21 = 11056353520061 is a prime.
Together with 11056353520061, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11056353519998 and 11056353520025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11056353520061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5528176760031 + 5528176760032.
It is an arithmetic number, because the mean of its divisors is an integer number (5528176760032).
Almost surely, 211056353520063 is an apocalyptic number.
11056353520063 is a deficient number, since it is larger than the sum of its proper divisors (1).
11056353520063 is an equidigital number, since it uses as much as digits as its factorization.
11056353520063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243000, while the sum is 40.
Adding to 11056353520063 its reverse (36002535365011), we get a palindrome (47058888885074).
The spelling of 11056353520063 in words is "eleven trillion, fifty-six billion, three hundred fifty-three million, five hundred twenty thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •