Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0011110100110111110001 |
3 | 1102222122022121011222011222 |
4 | 2200032302303310313301 |
5 | 2420401012241010001 |
6 | 35230214543314425 |
7 | 2214342605111324 |
oct | 240166263646761 |
9 | 42878277158158 |
10 | 11011001110001 |
11 | 3565815085762 |
12 | 129a009baba15 |
13 | 61b4436499b9 |
14 | 2a0d146547bb |
15 | 14164c3b761b |
hex | a03b2cf4df1 |
11011001110001 has 8 divisors (see below), whose sum is σ = 11022864158208. Its totient is φ = 10999139580000.
The previous prime is 11011001109991. The next prime is 11011001110013. The reversal of 11011001110001 is 10001110011011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11011001110001 - 242 = 6612954598897 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11011001110301) 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 in 7 ways as a sum of consecutive naturals, for example, 14444861 + ... + 15188021.
It is an arithmetic number, because the mean of its divisors is an integer number (1377858019776).
Almost surely, 211011001110001 is an apocalyptic number.
It is an amenable number.
11011001110001 is a deficient number, since it is larger than the sum of its proper divisors (11863048207).
11011001110001 is an equidigital number, since it uses as much as digits as its factorization.
11011001110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759103.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 11011001110001 its reverse (10001110011011), we get a palindrome (21012111121012).
The spelling of 11011001110001 in words is "eleven trillion, eleven billion, one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •