Base | Representation |
---|---|
bin | 11001101110011111000001… |
… | …001111011111001110111111 |
3 | 112211121121111000001201201001 |
4 | 121232133001033133032333 |
5 | 104312234104234310221 |
6 | 1040350204422031131 |
7 | 32555332406461132 |
oct | 3156370117371677 |
9 | 484547430051631 |
10 | 113145565541311 |
11 | 3306284605a626 |
12 | 10834450b784a7 |
13 | 4b19772744254 |
14 | 1dd23bb6a0219 |
15 | d13298592391 |
hex | 66e7c13df3bf |
113145565541311 has 4 divisors (see below), whose sum is σ = 113146229551824. Its totient is φ = 113144901530800.
The previous prime is 113145565541287. The next prime is 113145565541329.
It is a happy number.
113145565541311 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113145565541311 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 (113145565541611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331749595 + ... + 332090476.
It is an arithmetic number, because the mean of its divisors is an integer number (28286557387956).
Almost surely, 2113145565541311 is an apocalyptic number.
113145565541311 is a deficient number, since it is larger than the sum of its proper divisors (664010513).
113145565541311 is an equidigital number, since it uses as much as digits as its factorization.
113145565541311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664010512.
The product of its digits is 540000, while the sum is 46.
The spelling of 113145565541311 in words is "one hundred thirteen trillion, one hundred forty-five billion, five hundred sixty-five million, five hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •