Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …100001011010000101111001 |
3 | 112102110220020211101101121220 |
4 | 121000231133201122011321 |
5 | 103404220010030323001 |
6 | 1025541150150222253 |
7 | 32112144535563255 |
oct | 3100553741320571 |
9 | 472426224341556 |
10 | 110000010011001 |
11 | 3205a818a58650 |
12 | 104068a4954989 |
13 | 494bc58398026 |
14 | 1d240593c9265 |
15 | cab54553dc36 |
hex | 640b5f85a179 |
110000010011001 has 16 divisors (see below), whose sum is σ = 162711879217920. Its totient is φ = 65536729127120.
The previous prime is 110000010010967. The next prime is 110000010011069. The reversal of 110000010011001 is 100110010000011.
It is a cyclic number.
It is not a de Polignac number, because 110000010011001 - 211 = 110000010008953 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110000010011201) 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 15 ways as a sum of consecutive naturals, for example, 28248588195 + ... + 28248592088.
It is an arithmetic number, because the mean of its divisors is an integer number (10169492451120).
Almost surely, 2110000010011001 is an apocalyptic number.
110000010011001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110000010011001 is a deficient number, since it is larger than the sum of its proper divisors (52711869206919).
110000010011001 is a wasteful number, since it uses less digits than its factorization.
110000010011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56497180356.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110000010011001 its reverse (100110010000011), we get a palindrome (210110020011012).
The spelling of 110000010011001 in words is "one hundred ten trillion, ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •