Base | Representation |
---|---|
bin | 1010000000101010111101… |
… | …0000011100001110001011 |
3 | 1102222020002010021122100021 |
4 | 2200022233100130032023 |
5 | 2420313103003110201 |
6 | 35224214505521311 |
7 | 2214126650614456 |
oct | 240125720341613 |
9 | 42866063248307 |
10 | 11006646535051 |
11 | 3563990032092 |
12 | 12991b37a3237 |
13 | 61abcb42c92b |
14 | 2a0a201a249d |
15 | 141494e52ea1 |
hex | a02af41c38b |
11006646535051 has 2 divisors, whose sum is σ = 11006646535052. Its totient is φ = 11006646535050.
The previous prime is 11006646535021. The next prime is 11006646535069. The reversal of 11006646535051 is 15053564660011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11006646535051 - 29 = 11006646534539 is a prime.
It is a super-2 number, since 2×110066465350512 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11006646534989 and 11006646535007.
It is not a weakly prime, because it can be changed into another prime (11006646535021) 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, 5503323267525 + 5503323267526.
It is an arithmetic number, because the mean of its divisors is an integer number (5503323267526).
Almost surely, 211006646535051 is an apocalyptic number.
11006646535051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006646535051 is an equidigital number, since it uses as much as digits as its factorization.
11006646535051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 11006646535051 in words is "eleven trillion, six billion, six hundred forty-six million, five hundred thirty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.578 sec. • engine limits •