Base | Representation |
---|---|
bin | 10110111111001100101101… |
… | …100101100011110001001101 |
3 | 111020222001202211101100112020 |
4 | 112333030231211203301031 |
5 | 101222410300000013401 |
6 | 555004410540200353 |
7 | 30203143150653063 |
oct | 2677145545436115 |
9 | 436861684340466 |
10 | 101100000001101 |
11 | 2a2392a6368a82 |
12 | b409a355390b9 |
13 | 44548c5c2186a |
14 | 1ad73a22ba033 |
15 | ba4c9a270d36 |
hex | 5bf32d963c4d |
101100000001101 has 16 divisors (see below), whose sum is σ = 135675542059200. Its totient is φ = 66962336208768.
The previous prime is 101100000001087. The next prime is 101100000001111.
101100000001101 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 101100000001101 - 214 = 101099999984717 is a prime.
101100000001101 is a strobogrammatic number because it is the same when read upside-down.
It is a self number, because there is not a number n which added to its sum of digits gives 101100000001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100000001111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9628291 + ... + 17172768.
It is an arithmetic number, because the mean of its divisors is an integer number (8479721378700).
Almost surely, 2101100000001101 is an apocalyptic number.
It is an amenable number.
101100000001101 is a deficient number, since it is larger than the sum of its proper divisors (34575542058099).
101100000001101 is a wasteful number, since it uses less digits than its factorization.
101100000001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26809228.
The product of its (nonzero) digits is 1, while the sum is 6.
It can be divided in two parts, 10110000000 and 1101, that added together give a palindrome (10110001101).
The spelling of 101100000001101 in words is "one hundred one trillion, one hundred billion, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •