Base | Representation |
---|---|
bin | 10100100000001001… |
… | …01010100100010111 |
3 | 1001102002202102112212 |
4 | 22100010222210113 |
5 | 140020302423011 |
6 | 5020115504035 |
7 | 536523415265 |
oct | 122004524427 |
9 | 31362672485 |
10 | 11007076631 |
11 | 4739231651 |
12 | 21722b801b |
13 | 10655346c5 |
14 | 765bd3435 |
15 | 4464db08b |
hex | 29012a917 |
11007076631 has 2 divisors, whose sum is σ = 11007076632. Its totient is φ = 11007076630.
The previous prime is 11007076621. The next prime is 11007076651. The reversal of 11007076631 is 13667070011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11007076631 - 26 = 11007076567 is a prime.
It is a super-2 number, since 2×110070766312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11007076621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503538315 + 5503538316.
It is an arithmetic number, because the mean of its divisors is an integer number (5503538316).
Almost surely, 211007076631 is an apocalyptic number.
11007076631 is a deficient number, since it is larger than the sum of its proper divisors (1).
11007076631 is an equidigital number, since it uses as much as digits as its factorization.
11007076631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 32.
The spelling of 11007076631 in words is "eleven billion, seven million, seventy-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •