Base | Representation |
---|---|
bin | 10100011111010011… |
… | …01110000011011011 |
3 | 1001101121110120002121 |
4 | 22033221232003123 |
5 | 140012000404034 |
6 | 5015304242111 |
7 | 536406365542 |
oct | 121751560333 |
9 | 31347416077 |
10 | 11000013019 |
11 | 4735247656 |
12 | 216ba70337 |
13 | 1063c30558 |
14 | 764cb5159 |
15 | 445a931b4 |
hex | 28fa6e0db |
11000013019 has 2 divisors, whose sum is σ = 11000013020. Its totient is φ = 11000013018.
The previous prime is 11000012951. The next prime is 11000013043. The reversal of 11000013019 is 91031000011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11000013019 - 221 = 10997915867 is a prime.
It is a super-2 number, since 2×110000130192 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11000012993 and 11000013011.
It is not a weakly prime, because it can be changed into another prime (11000013719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500006509 + 5500006510.
It is an arithmetic number, because the mean of its divisors is an integer number (5500006510).
Almost surely, 211000013019 is an apocalyptic number.
11000013019 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000013019 is an equidigital number, since it uses as much as digits as its factorization.
11000013019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
The spelling of 11000013019 in words is "eleven billion, thirteen thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •