Base | Representation |
---|---|
bin | 10110101111001100010111… |
… | …001110110011111001001111 |
3 | 111010001220202211112100011221 |
4 | 112233030113032303321033 |
5 | 101101400213001430221 |
6 | 552403230131224211 |
7 | 30030525013235023 |
oct | 2657142716637117 |
9 | 433056684470157 |
10 | 100000113311311 |
11 | 2995489aa6a694 |
12 | b270837748067 |
13 | 43a4c7c76a565 |
14 | 1a9a061caa383 |
15 | b86374703541 |
hex | 5af3173b3e4f |
100000113311311 has 4 divisors (see below), whose sum is σ = 100000133451072. Its totient is φ = 100000093171552.
The previous prime is 100000113311257. The next prime is 100000113311339. The reversal of 100000113311311 is 113113311000001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100000113311311 - 211 = 100000113309263 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 (100000113311341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3258615 + ... + 14512711.
It is an arithmetic number, because the mean of its divisors is an integer number (25000033362768).
Almost surely, 2100000113311311 is an apocalyptic number.
100000113311311 is a deficient number, since it is larger than the sum of its proper divisors (20139761).
100000113311311 is an equidigital number, since it uses as much as digits as its factorization.
100000113311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20139760.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 100000113311311 its reverse (113113311000001), we get a palindrome (213113424311312).
The spelling of 100000113311311 in words is "one hundred trillion, one hundred thirteen million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •