Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …100001010111101011001101 |
3 | 112102110220020211100220001020 |
4 | 121000231133201113223031 |
5 | 103404220010030013401 |
6 | 1025541150150104353 |
7 | 32112144535522353 |
oct | 3100553741275315 |
9 | 472426224326036 |
10 | 110000010001101 |
11 | 3205a818a51170 |
12 | 104068a494b0b9 |
13 | 494bc5839367c |
14 | 1d240593c57d3 |
15 | cab54553ad36 |
hex | 640b5f857acd |
110000010001101 has 32 divisors (see below), whose sum is σ = 164388608435328. Its totient is φ = 64839501354240.
The previous prime is 110000010001093. The next prime is 110000010001151. The reversal of 110000010001101 is 101100010000011.
It is not a de Polignac number, because 110000010001101 - 23 = 110000010001093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110000010001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000010001151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14494270 + ... + 20738463.
It is an arithmetic number, because the mean of its divisors is an integer number (5137144013604).
Almost surely, 2110000010001101 is an apocalyptic number.
110000010001101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110000010001101 is a deficient number, since it is larger than the sum of its proper divisors (54388598434227).
110000010001101 is a wasteful number, since it uses less digits than its factorization.
110000010001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35235341.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 110000010001101 its reverse (101100010000011), we get a palindrome (211100020001112).
The spelling of 110000010001101 in words is "one hundred ten trillion, ten million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •