Base | Representation |
---|---|
bin | 11001101100010101010111… |
… | …110111111011001000100101 |
3 | 112211002110222210112211101002 |
4 | 121230111113313323020211 |
5 | 104302323412312242024 |
6 | 1040154243002243045 |
7 | 32541551023464026 |
oct | 3154252767731045 |
9 | 484073883484332 |
10 | 112997768868389 |
11 | 330060a2753749 |
12 | 1080b8841b6485 |
13 | 4b0884a7bc932 |
14 | 1dc919a7b4c4d |
15 | d0e4e813a6ae |
hex | 66c557dfb225 |
112997768868389 has 2 divisors, whose sum is σ = 112997768868390. Its totient is φ = 112997768868388.
The previous prime is 112997768868373. The next prime is 112997768868419. The reversal of 112997768868389 is 983868867799211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77975222408164 + 35022546460225 = 8830358^2 + 5917985^2 .
It is a cyclic number.
It is not a de Polignac number, because 112997768868389 - 24 = 112997768868373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112997768868298 and 112997768868307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112997768868319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56498884434194 + 56498884434195.
It is an arithmetic number, because the mean of its divisors is an integer number (56498884434195).
Almost surely, 2112997768868389 is an apocalyptic number.
It is an amenable number.
112997768868389 is a deficient number, since it is larger than the sum of its proper divisors (1).
112997768868389 is an equidigital number, since it uses as much as digits as its factorization.
112997768868389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31603654656, while the sum is 92.
The spelling of 112997768868389 in words is "one hundred twelve trillion, nine hundred ninety-seven billion, seven hundred sixty-eight million, eight hundred sixty-eight thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •