Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000110100011010101111111 |
3 | 111010002000022200001020020200 |
4 | 112233031102012203111333 |
5 | 101101404223324031421 |
6 | 552403512133014543 |
7 | 30030561335411031 |
oct | 2657152206432577 |
9 | 433060280036220 |
10 | 100001101002111 |
11 | 29955257546381 |
12 | b270a72484453 |
13 | 43a50a9287a9a |
14 | 1a9a117131c51 |
15 | b863d12a2726 |
hex | 5af3521a357f |
100001101002111 has 24 divisors (see below), whose sum is σ = 149657886312480. Its totient is φ = 64269037000896.
The previous prime is 100001101002029. The next prime is 100001101002241. The reversal of 100001101002111 is 111200101100001.
It is not a de Polignac number, because 100001101002111 - 213 = 100001100993919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100001101002093 and 100001101002102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001101002911) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 295925400 + ... + 296263133.
It is an arithmetic number, because the mean of its divisors is an integer number (6235745263020).
Almost surely, 2100001101002111 is an apocalyptic number.
100001101002111 is a deficient number, since it is larger than the sum of its proper divisors (49656785310369).
100001101002111 is a wasteful number, since it uses less digits than its factorization.
100001101002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592189215 (or 592189212 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100001101002111 its reverse (111200101100001), we get a palindrome (211201202102112).
The spelling of 100001101002111 in words is "one hundred trillion, one billion, one hundred one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •