Base | Representation |
---|---|
bin | 1010000011100100001000… |
… | …0001100010100111001001 |
3 | 1110010222101021202002222112 |
4 | 2200321002001202213021 |
5 | 2422121403000120243 |
6 | 35303115123032105 |
7 | 2220536514202241 |
oct | 240710201424711 |
9 | 43128337662875 |
10 | 11056353520073 |
11 | 3582a783616a4 |
12 | 12a696650b635 |
13 | 6227c0578cc4 |
14 | 2a31b7a1ab21 |
15 | 142903c18818 |
hex | a0e420629c9 |
11056353520073 has 2 divisors, whose sum is σ = 11056353520074. Its totient is φ = 11056353520072.
The previous prime is 11056353520063. The next prime is 11056353520087. The reversal of 11056353520073 is 37002535365011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5970462563209 + 5085890956864 = 2443453^2 + 2255192^2 .
It is a cyclic number.
It is not a de Polignac number, because 11056353520073 - 240 = 9956841892297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11056353520073.
It is not a weakly prime, because it can be changed into another prime (11056353520063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5528176760036 + 5528176760037.
It is an arithmetic number, because the mean of its divisors is an integer number (5528176760037).
Almost surely, 211056353520073 is an apocalyptic number.
It is an amenable number.
11056353520073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11056353520073 is an equidigital number, since it uses as much as digits as its factorization.
11056353520073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 283500, while the sum is 41.
Adding to 11056353520073 its reverse (37002535365011), we get a palindrome (48058888885084).
The spelling of 11056353520073 in words is "eleven trillion, fifty-six billion, three hundred fifty-three million, five hundred twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •