Base | Representation |
---|---|
bin | 10100100101010101… |
… | …00010111000000111 |
3 | 1001112010120122221012 |
4 | 22102222202320013 |
5 | 140112420423111 |
6 | 5024311512435 |
7 | 540562135046 |
oct | 122252427007 |
9 | 31463518835 |
10 | 11050561031 |
11 | 4760832074 |
12 | 218498871b |
13 | 107154b213 |
14 | 76b8b255d |
15 | 44a22a48b |
hex | 292aa2e07 |
11050561031 has 2 divisors, whose sum is σ = 11050561032. Its totient is φ = 11050561030.
The previous prime is 11050560967. The next prime is 11050561033. The reversal of 11050561031 is 13016505011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11050561031 - 26 = 11050560967 is a prime.
It is a super-2 number, since 2×110505610312 (a number of 21 digits) contains 22 as substring.
Together with 11050561033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11050560988 and 11050561006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11050561033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5525280515 + 5525280516.
It is an arithmetic number, because the mean of its divisors is an integer number (5525280516).
Almost surely, 211050561031 is an apocalyptic number.
11050561031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11050561031 is an equidigital number, since it uses as much as digits as its factorization.
11050561031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 23.
The spelling of 11050561031 in words is "eleven billion, fifty million, five hundred sixty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •