Base | Representation |
---|---|
bin | 1010000000101000110000… |
… | …0000001000001011110111 |
3 | 1102222011112220022101210011 |
4 | 2200022030000020023313 |
5 | 2420310400043243434 |
6 | 35224040100241051 |
7 | 2214106206255214 |
oct | 240121400101367 |
9 | 42864486271704 |
10 | 11006055056119 |
11 | 3563707174222 |
12 | 12990696a0187 |
13 | 61ab35a286b6 |
14 | 2a09a57d6b0b |
15 | 14145d069e64 |
hex | a028c0082f7 |
11006055056119 has 2 divisors, whose sum is σ = 11006055056120. Its totient is φ = 11006055056118.
The previous prime is 11006055055999. The next prime is 11006055056123. The reversal of 11006055056119 is 91165055060011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11006055056119 - 213 = 11006055047927 is a prime.
It is a super-2 number, since 2×110060550561192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11006055056189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503027528059 + 5503027528060.
It is an arithmetic number, because the mean of its divisors is an integer number (5503027528060).
Almost surely, 211006055056119 is an apocalyptic number.
11006055056119 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006055056119 is an equidigital number, since it uses as much as digits as its factorization.
11006055056119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 40.
The spelling of 11006055056119 in words is "eleven trillion, six billion, fifty-five million, fifty-six thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •