Base | Representation |
---|---|
bin | 10100011111111001… |
… | …11011110010101111 |
3 | 1001101221221110120121 |
4 | 22033330323302233 |
5 | 140014243100111 |
6 | 5020004225411 |
7 | 536500244653 |
oct | 121774736257 |
9 | 31357843517 |
10 | 11005050031 |
11 | 4738077a78 |
12 | 217169b267 |
13 | 1064ca5131 |
14 | 765826a63 |
15 | 44623a871 |
hex | 28ff3bcaf |
11005050031 has 2 divisors, whose sum is σ = 11005050032. Its totient is φ = 11005050030.
The previous prime is 11005049963. The next prime is 11005050037. The reversal of 11005050031 is 13005050011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11005050031 - 225 = 10971495599 is a prime.
It is a super-2 number, since 2×110050500312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11005049987 and 11005050014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11005050037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5502525015 + 5502525016.
It is an arithmetic number, because the mean of its divisors is an integer number (5502525016).
Almost surely, 211005050031 is an apocalyptic number.
11005050031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11005050031 is an equidigital number, since it uses as much as digits as its factorization.
11005050031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75, while the sum is 16.
The spelling of 11005050031 in words is "eleven billion, five million, fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •