Base | Representation |
---|---|
bin | 11001111001001100010001… |
… | …011100010111100111001101 |
3 | 112221012221200010021112012021 |
4 | 121321030101130113213031 |
5 | 104411313001212042421 |
6 | 1042112211543210141 |
7 | 32662441012451464 |
oct | 3171142134274715 |
9 | 487187603245167 |
10 | 113881350502861 |
11 | 3331689a529507 |
12 | 10932b75a46951 |
13 | 4b70c71920a46 |
14 | 2019c5b4439db |
15 | d274ae081341 |
hex | 6793117179cd |
113881350502861 has 2 divisors, whose sum is σ = 113881350502862. Its totient is φ = 113881350502860.
The previous prime is 113881350502841. The next prime is 113881350502973. The reversal of 113881350502861 is 168205053188311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99545517562500 + 14335832940361 = 9977250^2 + 3786269^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113881350502861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113881350502799 and 113881350502808.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113881350502841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56940675251430 + 56940675251431.
It is an arithmetic number, because the mean of its divisors is an integer number (56940675251431).
Almost surely, 2113881350502861 is an apocalyptic number.
It is an amenable number.
113881350502861 is a deficient number, since it is larger than the sum of its proper divisors (1).
113881350502861 is an equidigital number, since it uses as much as digits as its factorization.
113881350502861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1382400, while the sum is 52.
The spelling of 113881350502861 in words is "one hundred thirteen trillion, eight hundred eighty-one billion, three hundred fifty million, five hundred two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •