Base | Representation |
---|---|
bin | 10110101111001100010000… |
… | …011110100100010001001101 |
3 | 111010001220110221022120210111 |
4 | 112233030100132210101031 |
5 | 101101400000000013401 |
6 | 552403211002440021 |
7 | 30030522136145404 |
oct | 2657142036442115 |
9 | 433056427276714 |
10 | 100000000001101 |
11 | 29954842007a92 |
12 | b270805803011 |
13 | 43a4c621465b5 |
14 | 1a9a050c1263b |
15 | b863697bee51 |
hex | 5af3107a444d |
100000000001101 has 8 divisors (see below), whose sum is σ = 100261633443840. Its totient is φ = 99738369355152.
The previous prime is 100000000001089. The next prime is 100000000001129. The reversal of 100000000001101 is 101100000000001.
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 100000000001101 - 219 = 99999999476813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000000007101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84446815 + ... + 85622803.
It is an arithmetic number, because the mean of its divisors is an integer number (12532704180480).
Almost surely, 2100000000001101 is an apocalyptic number.
It is an amenable number.
100000000001101 is a deficient number, since it is larger than the sum of its proper divisors (261633442739).
100000000001101 is a wasteful number, since it uses less digits than its factorization.
100000000001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1398395.
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 100000000001101 its reverse (101100000000001), we get a palindrome (201100000001102).
It can be divided in two parts, 100000000001 and 101, that multiplied together give a palindrome (10100000000101).
The spelling of 100000000001101 in words is "one hundred trillion, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •