Base | Representation |
---|---|
bin | 11001011111011010011011… |
… | …010010000110101011010101 |
3 | 112200221121002121200202200022 |
4 | 121133122123102012223111 |
5 | 104143301423420341423 |
6 | 1034234314502554525 |
7 | 32420445246144521 |
oct | 3137323322065325 |
9 | 480847077622608 |
10 | 112109841574613 |
11 | 327a3575964813 |
12 | 106a777b138a45 |
13 | 4a72bb327389c |
14 | 1d98206934d81 |
15 | ce637a941dc8 |
hex | 65f69b486ad5 |
112109841574613 has 2 divisors, whose sum is σ = 112109841574614. Its totient is φ = 112109841574612.
The previous prime is 112109841574597. The next prime is 112109841574639. The reversal of 112109841574613 is 316475148901211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106796991753169 + 5312849821444 = 10334263^2 + 2304962^2 .
It is a cyclic number.
It is not a de Polignac number, because 112109841574613 - 24 = 112109841574597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112109841574663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56054920787306 + 56054920787307.
It is an arithmetic number, because the mean of its divisors is an integer number (56054920787307).
It is a 1-persistent number, because it is pandigital, but 2⋅112109841574613 = 224219683149226 is not.
Almost surely, 2112109841574613 is an apocalyptic number.
It is an amenable number.
112109841574613 is a deficient number, since it is larger than the sum of its proper divisors (1).
112109841574613 is an equidigital number, since it uses as much as digits as its factorization.
112109841574613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1451520, while the sum is 53.
The spelling of 112109841574613 in words is "one hundred twelve trillion, one hundred nine billion, eight hundred forty-one million, five hundred seventy-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •