Base | Representation |
---|---|
bin | 110100010011011011… |
… | …1110011000101100001 |
3 | 101201220212100210112021 |
4 | 1220212313303011201 |
5 | 3320013223423243 |
6 | 123333311301441 |
7 | 11054266251136 |
oct | 1504667630541 |
9 | 351825323467 |
10 | 112321311073 |
11 | 436a94a7514 |
12 | 1992821a881 |
13 | a7903c415a |
14 | 56175dc58d |
15 | 2dc5cc86ed |
hex | 1a26df3161 |
112321311073 has 2 divisors, whose sum is σ = 112321311074. Its totient is φ = 112321311072.
The previous prime is 112321311043. The next prime is 112321311143. The reversal of 112321311073 is 370113123211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110298380544 + 2022930529 = 332112^2 + 44977^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112321311073 is a prime.
It is a super-2 number, since 2×1123213110732 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112321311043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56160655536 + 56160655537.
It is an arithmetic number, because the mean of its divisors is an integer number (56160655537).
Almost surely, 2112321311073 is an apocalyptic number.
It is an amenable number.
112321311073 is a deficient number, since it is larger than the sum of its proper divisors (1).
112321311073 is an equidigital number, since it uses as much as digits as its factorization.
112321311073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 112321311073 its reverse (370113123211), we get a palindrome (482434434284).
The spelling of 112321311073 in words is "one hundred twelve billion, three hundred twenty-one million, three hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •