Base | Representation |
---|---|
bin | 11001101111010111011110… |
… | …001101100000001011100111 |
3 | 112211211101221101221021101211 |
4 | 121233113132031200023213 |
5 | 104314232224330233221 |
6 | 1040434111315532251 |
7 | 32562606462315253 |
oct | 3157273615401347 |
9 | 484741841837354 |
10 | 113206181102311 |
11 | 33086520a53790 |
12 | 10844148bba087 |
13 | 4b223b2887acb |
14 | 1dd52cbbcb263 |
15 | d14b44d886e1 |
hex | 66f5de3602e7 |
113206181102311 has 8 divisors (see below), whose sum is σ = 126125261731584. Its totient is φ = 100725035409720.
The previous prime is 113206181102297. The next prime is 113206181102327. The reversal of 113206181102311 is 113201181602311.
It is a happy number.
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 113206181102311 - 29 = 113206181101799 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 (113206181102011) 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, 109483733625 + ... + 109483734658.
It is an arithmetic number, because the mean of its divisors is an integer number (15765657716448).
Almost surely, 2113206181102311 is an apocalyptic number.
113206181102311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113206181102311 is a deficient number, since it is larger than the sum of its proper divisors (12919080629273).
113206181102311 is a wasteful number, since it uses less digits than its factorization.
113206181102311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218967468341.
The product of its (nonzero) digits is 1728, while the sum is 31.
The spelling of 113206181102311 in words is "one hundred thirteen trillion, two hundred six billion, one hundred eighty-one million, one hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •