Base | Representation |
---|---|
bin | 10100100011111100… |
… | …10011000001110011 |
3 | 1001111022202100202021 |
4 | 22101332103001303 |
5 | 140101433234104 |
6 | 5023215132311 |
7 | 540361425016 |
oct | 122176230163 |
9 | 31438670667 |
10 | 11038961779 |
11 | 475522a40a |
12 | 2180b14097 |
13 | 106c019761 |
14 | 76a13337d |
15 | 4491d8754 |
hex | 291f93073 |
11038961779 has 2 divisors, whose sum is σ = 11038961780. Its totient is φ = 11038961778.
The previous prime is 11038961777. The next prime is 11038961797. The reversal of 11038961779 is 97716983011.
11038961779 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (11038961797) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11038961779 - 21 = 11038961777 is a prime.
It is a super-3 number, since 3×110389617793 (a number of 31 digits) contains 333 as substring.
Together with 11038961777, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11038961777) 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, 5519480889 + 5519480890.
It is an arithmetic number, because the mean of its divisors is an integer number (5519480890).
Almost surely, 211038961779 is an apocalyptic number.
11038961779 is a deficient number, since it is larger than the sum of its proper divisors (1).
11038961779 is an equidigital number, since it uses as much as digits as its factorization.
11038961779 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 571536, while the sum is 52.
The spelling of 11038961779 in words is "eleven billion, thirty-eight million, nine hundred sixty-one thousand, seven hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •