Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …100101100011111101100001 |
3 | 112102110220020220102201110020 |
4 | 121000231133211203331201 |
5 | 103404220010320200001 |
6 | 1025541150225424053 |
7 | 32112144551050221 |
oct | 3100553745437541 |
9 | 472426226381406 |
10 | 110000011100001 |
11 | 3205a819631850 |
12 | 104068a519b029 |
13 | 494bc586898c9 |
14 | 1d240595d0081 |
15 | cab5456a6736 |
hex | 640b5f963f61 |
110000011100001 has 64 divisors (see below), whose sum is σ = 165308353044480. Its totient is φ = 64477500456960.
The previous prime is 110000011099969. The next prime is 110000011100047. The reversal of 110000011100001 is 100001110000011.
It is not a de Polignac number, because 110000011100001 - 25 = 110000011099969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110000011100081) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 149942850 + ... + 150674676.
It is an arithmetic number, because the mean of its divisors is an integer number (2582943016320).
Almost surely, 2110000011100001 is an apocalyptic number.
110000011100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110000011100001 is a deficient number, since it is larger than the sum of its proper divisors (55308341944479).
110000011100001 is a wasteful number, since it uses less digits than its factorization.
110000011100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 732614.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110000011100001 its reverse (100001110000011), we get a palindrome (210001121100012).
It can be divided in two parts, 110000011 and 100001, that multiplied together give a palindrome (11000111100011).
The spelling of 110000011100001 in words is "one hundred ten trillion, eleven million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •