Base | Representation |
---|---|
bin | 1010001000000000110100… |
… | …0000000111110100111101 |
3 | 1110102021122010011120101021 |
4 | 2202000031000013310331 |
5 | 2424344404440221401 |
6 | 35402154145344141 |
7 | 2226213334163131 |
oct | 242001500076475 |
9 | 43367563146337 |
10 | 11132773367101 |
11 | 3602423375871 |
12 | 12b9733338051 |
13 | 629a7ba5c5b9 |
14 | 2a6b870d13c1 |
15 | 1448c7c462a1 |
hex | a200d007d3d |
11132773367101 has 2 divisors, whose sum is σ = 11132773367102. Its totient is φ = 11132773367100.
The previous prime is 11132773367099. The next prime is 11132773367141. The reversal of 11132773367101 is 10176337723111.
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., 10472511487876 + 660261879225 = 3236126^2 + 812565^2 .
It is a cyclic number.
It is not a de Polignac number, because 11132773367101 - 21 = 11132773367099 is a prime.
Together with 11132773367099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11132773367141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5566386683550 + 5566386683551.
It is an arithmetic number, because the mean of its divisors is an integer number (5566386683551).
Almost surely, 211132773367101 is an apocalyptic number.
It is an amenable number.
11132773367101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11132773367101 is an equidigital number, since it uses as much as digits as its factorization.
11132773367101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 111132, while the sum is 43.
The spelling of 11132773367101 in words is "eleven trillion, one hundred thirty-two billion, seven hundred seventy-three million, three hundred sixty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •