Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0011001101010111000011 |
3 | 1102222122121012002011021101 |
4 | 2200032321103031113003 |
5 | 2420401223130000232 |
6 | 35230233433235231 |
7 | 2214345366501142 |
oct | 240167123152703 |
9 | 42878535064241 |
10 | 11011110000067 |
11 | 3565870599451 |
12 | 129a03a562b17 |
13 | 61b460083aa8 |
14 | 2a0d24cbb759 |
15 | 141656c261e7 |
hex | a03b94cd5c3 |
11011110000067 has 2 divisors, whose sum is σ = 11011110000068. Its totient is φ = 11011110000066.
The previous prime is 11011110000001. The next prime is 11011110000071. The reversal of 11011110000067 is 76000001111011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011110000067 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11011109999999 and 11011110000053.
It is not a weakly prime, because it can be changed into another prime (11011110000367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505555000033 + 5505555000034.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555000034).
Almost surely, 211011110000067 is an apocalyptic number.
11011110000067 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011110000067 is an equidigital number, since it uses as much as digits as its factorization.
11011110000067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 19.
Adding to 11011110000067 its reverse (76000001111011), we get a palindrome (87011111111078).
The spelling of 11011110000067 in words is "eleven trillion, eleven billion, one hundred ten million, sixty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •